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 |
|---|---|---|---|---|---|---|---|---|---|
| 1280 | Traveling Graph | bitmasks graph matchings graphs | Statement | D | Codeforces Alpha Round 21 (Codeforces format) {21} | PROGRAMMING | 2500 | ||
| 451 | Tetris revisited | constructive algorithms graph matchings greedy math | Statement | B | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2100 | |
| 1064 | Buying Sets | flows graph matchings | Statement | E | Codeforces Beta Round 80 (Div. 1 Only) {103} | PROGRAMMING | Tutorial | 2700 | |
| 1585 | Brevity is Soul of Wit | graph matchings | Statement | H | School Regional Team Contest, Saratov, 2011 {120} | PROGRAMMING | Tutorial for school regional team contest of Saratov | 1900 | |
| 388 | Shoe Store | dp graph matchings greedy sortings two pointers | Statement | D | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 2400 | |
| 217 | Wizards and Roads | data structures divide and conquer graph matchings graphs greedy | Statement | D | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2900 | |
| 165098 | Queue at the School | constructive algorithms graph matchings implementation shortest paths | Statement | B | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 900 | |
| 1668 | WTF? | *special graph matchings implementation trees | Statement | C | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1800 | |
| 667 | Tidying Up | flows graph matchings | Statement | C2 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2300 | ||
| 672 | Antichain | dp graph matchings greedy | Statement | E | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 2600 | |
| 430 | Ksenia and Combinatorics | combinatorics dp | Statement | E | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2600 | |
| 1160 | George and Interesting Graph | graph matchings | Statement | D | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2700 | |
| 5229 | Two Sets | 2-sat dfs and similar dsu graph matchings greedy | Statement | B | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2000 | |
| 475 | Tree | graph matchings | Statement | D | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3000 | |
| 385 | Permanent | dp graph matchings math meet-in-the-middle | Statement | E | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3100 | |
| 56516 | BerSU Ball | dfs and similar dp graph matchings greedy sortings two pointers | Statement | B | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1300 | |
| 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 | |
| 232 | Party | bitmasks brute force graph matchings | Statement | C | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2800 | |
| 882 | Birthday | graph matchings strings | Statement | E | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 3100 | |
| 1876 | Hamiltonian Spanning Tree | dfs and similar dp graph matchings greedy trees | Statement | D | Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) {618} | PROGRAMMING | Wunder Fund Round 2016 Editorials | 2200 | |
| 137 | Tanya is 5! | graph matchings graphs greedy schedules | Statement | E | Codeforces Round 380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2) {737} | PROGRAMMING | 3300 | ||
| 214 | Recover a functional graph | graph matchings | Statement | D | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 3400 | |
| 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 | |
| 236 | Sloth | dfs and similar dp graph matchings trees | Statement | D | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 3000 | |
| 900 | Round Marriage | binary search graph matchings greedy | Statement | F | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2500 | |
| 1049 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 1945 | Session in BSU | binary search dfs and similar dsu graph matchings graphs | Statement | F | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2400 | |
| 1138 | Vasya and Maximum Matching | dp trees | Statement | F | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2600 | |
| 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 | |
| 552 | Random Forest Rank | dp graph matchings math trees | Statement | E | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 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 | |
| 2444 | Serge and Dining Room | binary search data structures graph matchings greedy implementation math trees | Statement | C | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 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 | |
| 2589 | Catowice City | 2-sat dfs and similar graph matchings graphs | Statement | D | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2400 | |
| 925 | Beautiful League | constructive algorithms flows graph matchings | Statement | E | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2700 | |
| 412 | New Year and Social Network | data structures graph matchings graphs math trees | Statement | F | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3100 | |
| 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 | |
| 36653 | Similar Pairs | constructive algorithms graph matchings greedy sortings | Statement | C | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1100 | |
| 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 | ||
| 1240 | Bicolored Segments | data structures dp graph matchings greedy sortings | Statement | F | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 433 | Distance Matching | binary search constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2500.0 | Codeforces Round #666 — Editorial | |
| 12520 | Colored Rectangles | dp graph matchings greedy sortings | Statement | D | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 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 | ||
| 4177 | Strange Housing | constructive algorithms dfs and similar dsu graph matchings graphs | Statement | D | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 1500.0 | 86464 | |
| 3284 | New Year's Puzzle | brute force dp graph matchings greedy sortings | Statement | F | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 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 | ||
| 394 | Goblins And Gnomes | brute force dp graph matchings | Statement | F | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 765 | AquaMoon and Permutations | combinatorics constructive algorithms graph matchings graphs | Statement | C | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 1500.0 | Codeforces Round #732 Editorial | 2800 |
| 2479 | Moment of Bloom | constructive algorithms dfs and similar graph matchings graphs greedy | Statement | E | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 2250.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 968 | Alice and Recoloring 2 | flows graph matchings greedy | Statement | F2 | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1750.0 | 95583 | |
| 172 | Maximum Adjacent Pairs | constructive algorithms graph matchings | Statement | G | Codeforces Global Round 18 {1615} | PROGRAMMING | 3750.0 | Global Round 18 Editorial | |
| 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 | ||
| 2087 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 615 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 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 |
| 9433 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 17724 | Split Into Two Sets | dfs and similar dsu graph matchings graphs | Statement | E | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 578 | Two Arrays | games graph matchings | Statement | E | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 2750.0 | Codeforces Round #810 Editorial | |
| 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 |
| 513 | Matching Reduction | graph matchings interactive | Statement | F | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 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 | |
| 304 | Hero to Zero | graph matchings | Statement | J | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2900 | |
| 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 | |
| 638 | Dominoes | flows graph matchings | Statement | D | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2600 | ||
| 230 | Good Graph | bitmasks graph matchings graphs implementation | Statement | F | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 3000.0 | Codeforces Round 880 Editorial | |
| 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 | ||
| 7267 | Medium Demon Problem (easy version) | dfs and similar graph matchings graphs | Statement | G1 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 12478 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 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 | |
| 5241 | Serval and Kaitenzushi Buffet | data structures graph matchings greedy | Statement | D | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1750.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 1672 | Twin Polynomials | combinatorics graph matchings graphs math | Statement | C | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 881 | Path Split | dp graph matchings greedy | Statement | D | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 2500.0 | 148452 | |
| 2002 | Swap to Rearrange | constructive algorithms dfs and similar graph matchings graphs greedy strings | Statement | E | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 2250.0 | Codeforces Round 1081 (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 |