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 |
|---|---|---|---|---|---|---|---|---|---|
| 1421 | Happy Tree Party | data structures dfs and similar graphs math trees | Statement | D | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 2300 | ||
| 1086 | New Year and the Acquaintance Estimation | binary search data structures graphs greedy implementation math sortings | Statement | E | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2400 | |
| 2114 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 1008 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 1162 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 3868 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 412 | New Year and Social Network | data structures graph matchings graphs math trees | Statement | F | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3100 | |
| 6769 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 1721 | Complete the MST | data structures dfs and similar dsu graphs greedy math | Statement | C | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 600 | Gregor and the Two Painters | data structures graphs math | Statement | E | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 3500.0 | Codeforces Round 736 Editorial | |
| 1736 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 1962 | AND-MEX Walk | bitmasks brute force data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 10978 | Where is the Pizza? | data structures dfs and similar dsu graphs implementation math | Statement | C | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1750.0 | Tutorial | 1400 |
| 10240 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 1902 | There Should Be a Lot of Maximums | data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1918 | 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 | |
| 1198 | 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 | |
| 676 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 105 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 1492 | Gleb and Boating | brute force constructive algorithms data structures dp graphs greedy math shortest paths | Statement | G | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 270 | Kia Bakes a Cake | data structures dp graphs greedy | Statement | E | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 3250.0 | 142788 |