Codeforces Round #751 (Div. 2) ABCD Solutions (Java/C++)
A. Two Subsequences Solution: Obviously the string a will only have one letter. We only need to find the smallest letter in the original string. Code: Java C++…
Codeforces Round #751 (Div. 2) Frog Traveler Solution (Java/C++)
Solution: First of all, because after reaching 0, there will be no slip. Therefore, we consider slip as part of the ability to jump.…
Codeforces Round #750 ABCDE Solutions (Java/C++)
A. Luntik and Concerts It's easy to guess the result: just look at the parity of the total time. But the proof of this topic is still a bit interesting.…
Codeforces Round #750 Pchelyonok and Segments Solution (Java/C++)
Solution: Let's take k=3, n=10 as an example, consider the choice of [l1, r1], consider the following two choices: [4, 6] and [3, 5].…
Codeforces Round #750 Luntik and Concerts Solution (Java/C++)
Solution: Let me show the conclusion first. The conclusion is that if the total time is an even number, output 0, otherwise output 1.…
Codeforces Round #748 ABCDEFG Solutions (Java/C++)
A. Elections Solution: Calculate the difference between the maximum number of votes of the other two people and add one. Code: Java C++…
Codeforces Round #748 All are Same/Half of Same Solutions (Java/C++)
Solution: D1. All are Same First, if all numbers are the same, then k can be any value. So we only need to consider the situation where there are different numbers.…
Codeforces Round #748 Changing Brackets Solution (Java/C++)
Solution: First of all, according to the description of the problem, we can know that the direction of the brackets does not affect the result at all. So naturally, we only need to consider the parity of different types of brackets.…
