Codeforces Round #759 ABCD Solutions (Java/C++)
A. Life of a Flower Solution: Just simulate according to the description of the problem. Code: Java C++…
Codeforces Round #758 ABCD Solutions (Java/C++)
A. Find Array Solution: Obviously, when x>0, x cannot be divisible by x+1. Therefore, we can set a[i]=a[i-1]+1. Code: Java C++…
Codeforces Round #758 Dominoes Solution (Java/C++)
Solution: First of all, we need to notice that after the domino is painted, there are actually only 4 states: BW, WB, WW, BB.…
Educational Codeforces Round 118 ABCDE Solutions (Java/C++)
A. Long Comparison Solution: First, we can compare the digits of x. If the digits are different, we will continue to multiply the number with less digits by 10 until the digits are the same.…
Educational Codeforces Round 118 MEX Sequences Solution (Java/C++)
Solution: First, we consider what options are available to meet the conditions. Obviously [0, 1, 2, 3, 4, 5] is eligible, because for any i, x[i]-MEX(x[1],..., x[i])=-1.…
Codeforces Round #757 Divan and bitwise operations Solution (Java/C++)
Solution: We first consider how to construct an array A that matches the input.…
Codeforces Round #756 ABCDEFG Solutions (Java/C++)
A. Make Even Solution: Obviously, if there is no even number, -1 is output. If the last digit itself is an even number, 0 is output. If the first digit is an even number, 1 is output. Otherwise, output 2.…
Codeforces Round #756 Robot and Candies Solution (Java/C++)
Solution: First of all, we can immediately find that for the grid (x, y), no matter how the robot moves, the parity of the grid x+y is always the same. So it is natural to solve for odd and even numbers separately.…
