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 |
|---|---|---|---|---|---|---|---|---|---|
| 262 | Iqea | data structures dfs and similar divide and conquer dsu shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 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 | |
| 2482 | Unique Occurrences | data structures dfs and similar divide and conquer dp dsu trees | Statement | F | Educational Codeforces Round 129 (рейтинговый для Div. 2) {1681} | PROGRAMMING | 103163 | 2300 | |
| 713 | Li Hua and Path | data structures dfs and similar divide and conquer dsu trees | Statement | F | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 3000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 5430 | Count Paths | data structures dfs and similar divide and conquer dp dsu trees | Statement | E | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 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 |