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
Watching Movies at 2x Solution || Codechef February Lunchtime 2022 Get link Facebook X Pinterest Email Other Apps - March 01, 2022 Watching Movies at 2x Solution Codechef February Lunchtime 2022Problem Code : MOVIE2XProblem Link : https://www.codechef.com/LTIME105C/problems/MOVIE2XSolution :#include <bits/stdc++.h>#define ll long long int#define ull unsigned long long intusing namespace std;void solve(){ ll x, y; cin >> x >> y; cout << (y / 2) + (x - y) << "\n";}int main(){ solve();} Get link Facebook X Pinterest Email Other Apps Comments
Exact Marks Solution || Codechef March Long Challenge 2022 - I - March 11, 2022 Exact Marks Solution Read more
Substring of a Substring Solution || Codechef March Long Challenge 2022 - I - March 11, 2022 Substring of a Substring Solution Read more
Binary Base Basics Solution || Codechef February Long Challenge 2022 - I - February 04, 2022 Binary Base Basics Solution Read more
Comments
Post a Comment