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
Qualify The Round Solution || Codechef Starters - 28 Get link Facebook X Pinterest Email Other Apps - March 02, 2022 Qualify The Round Solution Codechef Starters - 28Problem Code : QUALIFYProblem Link : https://www.codechef.com/START28D/problems/QUALIFYSolution :#include <bits/stdc++.h>#define ll long long int#define ull unsigned long long intusing namespace std;void solve(){ ll x, a, b; cin >> x >> a >> b; if ((a + 2 * b) >= x) { cout << "Qualify\n"; } else { cout << "NotQualify\n"; }}int main(){ ll t; cin >> t; while (t--) { 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