Educational codeforces round 112 (rated for Div. 2)

A. PizzaForces A. PizzaForces Easy to understand, omitted Idea: simply be greedy. Divide n into such forms as n=10+x+10y, then 10y individuals use y large cakes, and the remaining 10+x uses three combinations of cakes to see which saves the most time AC_code: #include<bits/stdc++.h> using namespace std; typedef long long ll; int main( ...

Posted by jola on Thu, 16 Sep 2021 02:35:10 +0200