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
Infernos Solution || Codechef Starters - 37 Get link Facebook X Pinterest Email Other Apps - May 04, 2022 Infernos Solution Codechef Starters - 37Problem Code : INFERNOProblem Link : https://www.codechef.com/START37C/problems/INFERNOSolution :#include <bits/stdc++.h>#define ll long long intusing namespace std;int main(){ ll t = 1; cin >> t; while (t--) { ll n, x; cin >> n >> x; ll a[n]; ll s = 0; ll t = 0; for (ll i = 0; i < n; i++) { cin >> a[i]; s = max(s, a[i]); t += ((a[i] + x - 1) / x); } cout << min(s, t) << "\n"; }} Get link Facebook X Pinterest Email Other Apps Comments
Substring of a Substring Solution || Codechef March Long Challenge 2022 - I - March 11, 2022 Substring of a Substring Solution Read more
Exact Marks Solution || Codechef March Long Challenge 2022 - I - March 11, 2022 Exact Marks Solution Read more
Comments
Post a Comment