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
Count the Holidays Solution || Codechef Starters - 28 Get link Facebook X Pinterest Email Other Apps - March 02, 2022 Count the Holidays Solution Codechef Starters - 28Problem Code : SUNDAYProblem Link : https://www.codechef.com/START28D/problems/SUNDAYSolution :#include <bits/stdc++.h>#define ll long long int#define ull unsigned long long intusing namespace std;void solve(){ ll n; cin >> n; ll holiday = 8; for (ll i = 0; i < n; i++) { ll day; cin >> day; if (day != 7 && day != 14 && day != 21 && day != 28 && day != 6 && day != 13 && day != 20 && day != 27) { holiday++; } } cout << holiday << "\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