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
Chef and Bird Farm Solution || Codechef Starters - 36 Get link Facebook X Pinterest Email Other Apps - April 27, 2022 Chef and Bird Farm Solution Codechef Starters - 36Problem Code : BIRDFARMProblem Link : https://www.codechef.com/START36D/problems/BIRDFARMSolution :#include <bits/stdc++.h>#define ll long long intusing namespace std;int main(){ ll t = 1; cin >> t; while (t--) { ll x, y, z; cin >> x >> y >> z; if (z % x == 0 && z % y == 0) { cout << "ANY\n"; } else if (z % x == 0) { cout << "CHICKEN\n"; } else if (z % y == 0) { cout << "DUCK\n"; } else { cout << "NONE\n"; } }} 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