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 |
|---|---|---|---|---|---|---|---|---|---|
| 752 | Forced Online Queries Problem | data structures divide and conquer dsu graphs trees | Statement | F | Educational Codeforces Round 72 (рейтинговый для Див. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 973 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (рейтинговый для Див. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 623 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, по задачам Открытой олимпиады школьников по программированию) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 44 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Открытая олимпиада по программированию - заключительный этап, день 2 (вне рейтинга, зеркало, правила IOI) {1940} | PROGRAMMING |