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 |
|---|---|---|---|---|---|---|---|---|---|
| 1064 | Buying Sets | flows graph matchings | Statement | E | Codeforces Beta Round 80 (Div. 1 Only) {103} | PROGRAMMING | Tutorial | 2700 | |
| 667 | Tidying Up | flows graph matchings | Statement | C2 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2300 | ||
| 516 | Deciphering | flows graph matchings | Statement | C | Testing Round 11 {491} | PROGRAMMING | 2400 | ||
| 4144 | Array and Operations | flows graph matchings number theory | Statement | C | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2400 | |
| 451 | Oleg and chess | data structures divide and conquer flows graph matchings | Statement | G | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 51685 | 3100 | |
| 1232 | Exploration plan | binary search flows graph matchings shortest paths | Statement | D | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2400 | |
| 1049 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 2287 | Little C Loves 3 II | brute force constructive algorithms flows graph matchings | Statement | B | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2100 | |
| 574 | Last chance | data structures flows graph matchings trees | Statement | A | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2800 | |
| 386 | Electric Scheme | flows graph matchings | Statement | F | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 2600 | |
| 949 | Vasya and Endless Credits | dp flows graph matchings graphs sortings | Statement | F | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2700 | |
| 2264 | Maximize Mex | flows graph matchings graphs | Statement | E | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2400 | |
| 685 | The Doctor Meets Vader (Medium) | flows graph matchings graphs shortest paths sortings | Statement | B2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2300 | |
| 1295 | Rectangle Painting 2 | flows graph matchings graphs | Statement | E | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2500 | |
| 925 | Beautiful League | constructive algorithms flows graph matchings | Statement | E | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2700 | |
| 1474 | Summoning Minions | constructive algorithms dp flows graph matchings greedy sortings | Statement | F | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2500 | |
| 1873 | Network Coverage | binary search data structures flows graph matchings graphs greedy | Statement | F | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 1571 | Bricks | flows graph matchings graphs | Statement | E | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 3000.0 | Codeforces Round #668 Editorial | |
| 601 | Showing Off | flows graph matchings greedy | Statement | F | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2750.0 | Codeforces Round #673 Editorial | 3300 |
| 2092 | Valuable Paper | binary search flows graph matchings graphs | Statement | B | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 12137 | Chef Monocarp | dp flows graph matchings greedy | Statement | C | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 973 | Button Lock | flows graph matchings | Statement | B | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 968 | Alice and Recoloring 2 | flows graph matchings greedy | Statement | F2 | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1750.0 | 95583 | |
| 26796 | Division by Two and Permutation | constructive algorithms flows graph matchings greedy math | Statement | C | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 775 | Euclid Guess | constructive algorithms flows graph matchings math number theory | Statement | G | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2800 |
| 632 | Madoka and The First Session | constructive algorithms dfs and similar flows graph matchings graphs | Statement | F | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 3000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2500 |
| 506 | Fishermen | flows graph matchings | Statement | F | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 1238 | House Planning | constructive algorithms data structures flows graph matchings greedy | Statement | E | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 2250.0 | Codeforces Round #824 — editorial | |
| 846 | Access Levels | flows graph matchings | Statement | A | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2400 | |
| 638 | Dominoes | flows graph matchings | Statement | D | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2600 | ||
| 1320 | Matrix Problem | flows graph matchings graphs | Statement | E | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 1514 | The Most Reckless Defense | bitmasks brute force constructive algorithms dp flows graph matchings | Statement | H | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 2005 | Best Subsequence | bitmasks dfs and similar flows graph matchings graphs | Statement | E | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 101 | Kevin and Stones (Easy Version) | flows graph matchings graphs | Statement | H1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 3000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 167 | Permutation Factory | flows graph matchings graphs | Statement | G | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 4000.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 260 | Hanabi | data structures dp flows graph matchings graphs greedy | Statement | F | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial |