## Codeforces Round #761 ABCD solutions (Java/C++)

A. Forbidden Subsequence Solution: You can sort the strings directly, that is, you can directly output the string in the form of aaaabbbbccccdefg.…

Topic
175 Posts
## codeforces

Solutions for Codeforce。Include Div2 and Div3. Include Div1 ABC(<2500) also.

A. Forbidden Subsequence Solution: You can sort the strings directly, that is, you can directly output the string in the form of aaaabbbbccccdefg.…

A. Polycarp and Sums of Subsequences Solution: We assume a[1]<a[2]<a[3]. So naturally b[7]=a[1]+a[2]+a[3], b[6]=a[2]+a[3], b[5]=a[1]+a[3].…

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