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
Blackjack Solution || Codechef Starters - 27 Get link Facebook X Pinterest Email Other Apps - February 23, 2022 Blackjack Solution Codechef Starters - 27Problem Code : BLACKJACKProblem Link : https://www.codechef.com/START27B/problems/BLACKJACKSolution :#include <bits/stdc++.h>#define ll long long int#define ull unsigned long long intusing namespace std;void solve(){ ll a, b; cin >> a >> b; if ((a + b) >= 11) { cout << 21 - a - b << "\n"; } else { cout << -1 << "\n"; }}int main(){ ll t; cin >> t; while (t--) { solve(); }} 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