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 |
|---|---|---|---|---|---|---|---|---|---|
| 402 | Perpetual Motion Machine | constructive algorithms dp graphs implementation math trees | Statement | E | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 3100 | |
| 1060 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 708 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 9285 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 1077 | 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) | |
| 968 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 1399 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 7602 | Connect the Dots | brute force dfs and similar dp dsu graphs math trees | Statement | D | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1969 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1261 | Digital Village (Hard Version) | data structures dp dsu graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 406 | Managing Cluster | dp graphs math trees | Statement | M | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 3459 | Tree Colorings | combinatorics dp graphs math trees | Statement | E | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 6175 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial |