## Codeforces Round #760 ABCDEFG Solutions (Java/C++)

A. Polycarp and Sums of Subsequences Solution: We assume a[1]

A. Polycarp and Sums of Subsequences Solution: We assume a[1]

Solution: First, we can directly consider all items together. Let's consider the following example (I modified it a little bit based on the sample data):…

A. Life of a Flower Solution: Just simulate according to the description of the problem. Code: 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++…

Solution: First of all, we need to notice that after the domino is painted, there are actually only 4 states: BW, WB, WW, BB.…

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.…

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.…

Solution: We first consider how to construct an array A that matches the input.…