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
Control the Pollution Solution || Codechef Starters - 26 Get link Facebook X Pinterest Email Other Apps - February 16, 2022 Control the Pollution Solution Codechef Starters - 26Problem Code : SMOKEProblem Link : https://www.codechef.com/START26B/problems/SMOKESolution :#include <bits/stdc++.h>#define ll long long int#define ull unsigned long long intusing namespace std;void solve(){ ll n, x, y; cin >> n >> x >> y; ll ans = 0; if (n >= 100) { ans += (n / 100) * min(25 * y, x); n -= (n / 100) * 100; } ll car; if (n % 4 == 0) { car = n / 4; } else { car = (n / 4) + 1; } ans += min(x, car * y); cout << ans << "\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