Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2166 | Beaver Game | dp games number theory | Statement | C | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 1900 | |
| 1590 | Beautiful Decomposition | dp games greedy number theory | Statement | E | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Codeforces Round #171 (Div. 2) Разбор Задач | 2100 | |
| 1008 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 1174 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial |