Codeforces Round#715 Div.2
The same thinking field.
A. Average Height
Give an array and ask to rearrange its elements to meet
a
i
+
a
i
...
Added by jackiw on Fri, 04 Mar 2022 14:48:51 +0200
Educational Codeforces Round 109 (Rated for Div. 2) (A, B, D)
A. Potion-making
Solution idea: for a mathematical thinking problem, we abstract the description of the problem into w/(e+w)=k/100, because the input of k can be regarded as a known quantity. What we need to find is e+w, and then we move the formula to e+w=w*100/k. now the only unknown quantity of this formula becomes W. we just need to enum ...
Added by meehal on Fri, 11 Feb 2022 17:38:27 +0200
Codeforces Round #726 (Div. 2)
Portal Main idea of the title: There are t groups of samples, Each group has n numbers. You can add any positive integer of unlimited size after n numbers. So that the average of all numbers is 1.
Idea: For classified discussion, when the sum of N numbers is n, there is no need to add any numbers. When the sum of N numbers is less than N, an ...
Added by jschofield on Fri, 28 Jan 2022 21:07:02 +0200
Nearest Beautiful Number (easy version)
subject
Nearest Beautiful Number (easy version)
Problem Description
Given Data
n
(
1
≤
n
≤
1
0
9
...
Added by webguy262 on Mon, 20 Dec 2021 16:38:11 +0200
Codeforces Round #742 (Div. 2) A~D problem solution
A. Domino Disaster
meaning of the title Here you are
2
×
n
2 \times n
two × The grid of n is now used
1
...
Added by 758 on Tue, 14 Dec 2021 22:45:28 +0200