Count K-Subsequences of a String with Maximum Beauty Solution || Leetcode Bi-Weekly 112 Get link Facebook X Pinterest Email Other Apps - September 04, 2023 Count K-Subsequences of a String with Maximum Beauty Get link Facebook X Pinterest Email Other Apps
Presents for Cheffina Solution || Codechef Starters - 36 Get link Facebook X Pinterest Email Other Apps - April 27, 2022 Presents for Cheffina Solution Codechef Starters - 36Problem Code : PRESENTSProblem Link : https://www.codechef.com/START36D/problems/PRESENTSSolution :#include <bits/stdc++.h>#define ll long long intusing namespace std;int main(){ ll t = 1; cin >> t; while (t--) { ll n; cin >> n; if (n % 5 == 0) { cout << (n / 5) * 4; } else { cout << ((n / 5) * 4) + (n % 5); } cout << "\n"; }} Get link Facebook X Pinterest Email Other Apps Comments
Maximum OR Minimum Solution || Codechef Starters - 37 - May 04, 2022 Maximum OR Minimum Solution Read more
Infinite Replacement Solution || Codeforces Round #786 (Div 3) - May 02, 2022 Infinite Replacement Solution Read more
Count K-Subsequences of a String with Maximum Beauty Solution || Leetcode Bi-Weekly 112 - September 04, 2023 Count K-Subsequences of a String with Maximum Beauty Read more
Comments
Post a Comment