Codeforces Round #708 Genius - DP
This problem remind you about the memory limitation at very begin. Normally, it's State compression DP.…
Codeforces Round #708 k-LCM - Construction
When $k=3$, if n is a odd number, then the answer is: $a_0=1$, $a_1=\frac{n-1}{2}$, $a_2=\frac{n-1}{2}$ When $k>3$, we just fill up the array with 1 until last 3 elements.…
Codeforces Round #710 Div3 Solutions
Solutions for all problems in Codeforces Round #710 Div3.…
Codeforces Round #709 Basic Diplomacy - Greedy
Greedy. But the problem is how to prove. First of all, we have two different kinds of people. Type #1, the number of days they can join is not more than...…
Codeforces Round #705 K-beautiful Strings - implementation
Of course greedy. But it's very clear. So more a implementation problem.…
Codeforces Round #706 Let's Go Hiking - Game
Not hard, But need consider carefully. Still can be kind of game problem.…
Codeforces Round #706 Diamond Miner - Greedy
Simple Greedy. Pair the points who have smaller absolute value as soon as we can.…
