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 |
|---|---|---|---|---|---|---|---|---|---|
| 9584 | New Year Permutation | dfs and similar dsu graphs greedy math sortings | Statement | B | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1600 | |
| 61809 | Two Buttons | dfs and similar graphs greedy implementation math shortest paths | Statement | B | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 1400 | |
| 4202 | Amr and Chemistry | brute force graphs greedy math shortest paths | Statement | C | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2000 | |
| 461 | Tournament Construction | constructive algorithms dp graphs greedy math | Statement | D | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2700 | |
| 6625 | Relatively Prime Graph | brute force constructive algorithms graphs greedy math | Statement | D | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 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 | |
| 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 | |
| 966 | 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 |
| 4128 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 3167 | Divisor Paths | combinatorics graphs greedy math number theory | Statement | E | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 9216 | 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 |
| 2209 | Water Level | brute force graphs greedy implementation math | Statement | E | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2250.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 489 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 4847 | AB Graph | constructive algorithms graphs greedy implementation strings | Statement | D | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 15386 | Minimum Ties | brute force constructive algorithms dfs and similar graphs greedy implementation math | Statement | C | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 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 | |
| 446 | DIY Tree | graphs greedy math | Statement | H | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 3500.0 | 94384 | 3300 |
| 5337 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 12450 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 9178 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 1212 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 745 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 678 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 3983 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 2739 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8299 | Candy Party (Easy Version) | bitmasks constructive algorithms graphs greedy implementation math | Statement | B1 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 2169 | Jellyfish and EVA | dp graphs greedy math probabilities | Statement | C | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 1854 | Infinite Card Game | brute force dfs and similar games graphs greedy sortings | Statement | E | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 17364 | Permutation Game | brute force dfs and similar games graphs greedy math | Statement | D | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1300 | |
| 7869 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 7349 | Funny Game | constructive algorithms dsu graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 9292 | Iris and Game on the Tree | games graphs greedy trees | Statement | A | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 750.0 | Tutorial | |
| 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 | |
| 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 | |
| 1369 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | 135341 | |
| 2656 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | Codeforces Round #992 (Div.2) 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 | |
| 18221 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 1170 | MST in Modulo Graph | constructive algorithms dsu graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) 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 | ||
| 107 | Eulerian Line Graph | graphs greedy math | Statement | G | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 4000.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 877 | Sea, You & copriMe | brute force combinatorics constructive algorithms graphs greedy math number theory | Statement | H | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial |