Codeforces Round #723 Potions (Hard/Easy) Solution (Java/C++)
Solution: First, if there are not any limitations, we will drink all the potions. In fact, the only limitation is the health must not less than 0.…
Codeforces Round #723 Kill Anton Solution (Java/C++)
Solution: Let consider how Anton fix the DNS. We found that: for minimum cost, every time, Anton just fixing one character. For example, fix NNOTA to ANTON.…
Codeforces Round #722 (Div. 2) ABCD Solutions (Java/C++)
A. Eshag Loves Big Arrays Solution: Because can choose any subsequence. So, for some number x which is bigger than the minimum number of the array.…
Codeforces Round #722 Parsa's Humongous Tree Solution (Java/C++)
Solution: The first conclusion is: for any vertex, it will choose l or r. Because if and only if the case like example 2 can choose value between l and r…
Codeforces Round #722 Kavi on Pairing Duty Solution (Java/C++)
Solution: Define dp[i] to represent the answer when n=i. We use the case n=4 to explain the solution.…
Codeforces Round #721 MEX Tree Solution (Java/C++)
Solution: Use the node 0 as the root of tree. For each node, calculate the total number of children nodes (include itself) by DFS. Denote by "count".…
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.…
