Codeforces Round #721 Sequence Pair Weight Solution (Java/C++)
Solution: We put the same numbers together. Then we get the index array of same numbers. For example, for [1,2,1,1], we put same number together, so, we get: [0,2,3] and [1].…
Codeforces Round #721 Palindrome Game (easy/hard) Solution (Java/C++)
Solution: 1: Consider the simplest case: the string is palindrome, and the length of string is even. For example, 000000. For this case, Bob must win.…
Educational Codeforces Round 109 Assimilation IV Solution(Java/C++)
Solution: To get the expected number, we need calculate the total number of points can be conquered in all permutation.…
Educational Codeforces Round 109 ABCDE Solutions
A. Potion-making Solution: It is a fractional simplification of $ \frac k {100} $. The simplified denominator is the answer.…
Educational Codeforces Round 109 Armchairs Solution (Java/C++)
Solution: Define dp[i][j] to stand for the minimum cost if we move the people from the i th occupied armchair to j-th empty armchair.…
Educational Codeforces Round 109 Robot Collisions Solution (Java/C++)
Solution First, for any two robots $i$ and $j$, if $x_i\equiv x_j\mod 2$ (the remainder of 2 is same), then this two robots must meet and explode…
Educational Codeforces Round 104 ABCDE Solutions (C++/Java)
A. Arena Solution: If a hero is not the lowest level, then he can fight with lower-level heroes. Code: C++:…
Codeforces Round #720 Nastia and a Good Array - Java/C++
Solution: Because we can change at most n numbers. And the new value at most can be 2*10^9.So, we replace all the number to two big prime numbers:…
