Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
4444 | Finding Zero | constructive algorithms greedy interactive | Statement | D | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2000.0 | Codeforces Round #770 (Div. 2) editorial | |
1262 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
3231 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
11545 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
4356 | Coloring Game | constructive algorithms games graphs greedy interactive | Statement | E | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2000.0 | Video Tutorial | |
136 | Grid Game | constructive algorithms games greedy interactive | Statement | I | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 4000.0 | Video Tutorial |