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 |
|---|---|---|---|---|---|---|---|---|---|
| 398 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 1051 | Beautiful Road | dfs and similar dp dsu graphs implementation sortings trees | Statement | D | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2300 | |
| 1261 | Bear and Square Grid | dfs and similar dsu implementation | Statement | C | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | Codeforces Round #356 — Editorial | 2500 | |
| 7492 | Lakes in Berland | dfs and similar dsu graphs greedy implementation | Statement | D | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 1600 | ||
| 11854 | Timofey and a tree | dfs and similar dp dsu graphs implementation trees | Statement | A | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1600 | |
| 5947 | Sorting by Subsequences | dfs and similar dsu implementation math sortings | Statement | A | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 1400 | |
| 3013 | Unstable String Sort | data structures dfs and similar dsu graphs greedy implementation strings | Statement | F | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2400 | |
| 20761 | K-Complete Word | dfs and similar dsu greedy implementation strings | Statement | C | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1500 |
| 20687 | Solve The Maze | constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths | Statement | D | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #648 | 1700 |
| 1809 | Columns Swaps | 2-sat dfs and similar dsu graphs implementation | Statement | G | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 561 | Rain of Fire | binary search dfs and similar dsu graphs implementation sortings | Statement | F | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 3000.0 | Codeforces Round #671 Editorial | |
| 9221 | Journey | dfs and similar dp dsu implementation two pointers | Statement | D | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 2724 | Unusual Minesweeper | binary search dfs and similar dsu implementation sortings | Statement | G | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 504 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 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 |
| 1449 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 4388 | Koxia and Game | data structures dfs and similar dsu games graph matchings graphs implementation | Statement | D | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1500.0 | Good Bye 2022 -- Editorial | |
| 3896 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 2156 | Is It Flower? | dfs and similar dsu graphs implementation | Statement | F | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 26456 | The Lakes | dfs and similar dsu graphs implementation | Statement | E | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1100 | |
| 6364 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 7516 | Selling a Menagerie | dfs and similar dsu graphs implementation math | Statement | F | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 7206 | Maximize the Largest Component (Easy Version) | brute force data structures dfs and similar dsu graphs implementation | Statement | H1 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 1900 | Maximize the Largest Component (Hard Version) | data structures dfs and similar dsu implementation | Statement | H2 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 3796 | Medium Demon Problem (hard version) | dfs and similar dp dsu graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 1520 | Counting Is Not Fun (Easy Version) | combinatorics data structures dfs and similar dsu implementation math | Statement | F1 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 16043 | Disappearing Permutation | dfs and similar dsu graphs greedy implementation | Statement | C | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 2481 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial |