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 |
|---|---|---|---|---|---|---|---|---|---|
| 105 | Harry Potter and Moving Staircases | dfs and similar implementation | Statement | E | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2900 | |
| 693 | Evacuation | flows graphs shortest paths | Statement | E | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 2500 | |
| 568 | Bits of merry old England | flows graphs | Statement | E | Codeforces Beta Round 96 (Div. 1) {132} | PROGRAMMING | Codeforces Beta Round #96: editorial | 2600 | |
| 978 | Machine Programming | flows graphs | Statement | C | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2400 | |
| 222 | Privatization | flows graphs | Statement | A | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2700 | ||
| 208 | Planar Graph | flows geometry graphs | Statement | E | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | Tutorial | 3000 | |
| 1997 | Build String | flows graphs | Statement | E | Codeforces Round 147 (Div. 2) {237} | PROGRAMMING | Codeforces Round #147 (Div. 2) Разбор Задач | 2100 | |
| 1812 | Flawed Flow | constructive algorithms flows graphs greedy | Statement | C | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 1644 | k-Maximum Subsequence Sum | data structures flows graphs implementation | Statement | D | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2800 | |
| 910 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2800 | |
| 894 | Petya and Pipes | flows graphs shortest paths | Statement | E | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 2700 | |
| 4270 | Soldier and Traveling | flows graphs math | Statement | E | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 2300 | |
| 699 | New Year and Forgotten Tree | constructive algorithms flows graphs | Statement | H | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 3000 | |
| 2916 | Delivery Bears | binary search flows graphs | Statement | D | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 2100 | |
| 2248 | One-Way Reform | constructive algorithms dfs and similar flows graphs greedy | Statement | E | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 2300 | |
| 750 | ALT | data structures flows graphs trees | Statement | E | Codeforces Round 406 (Div. 1) {786} | PROGRAMMING | Codeforces Round #406 Editorial | 3200 | |
| 1486 | April Fools' Problem (medium) | binary search flows graphs | Statement | M2 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 1464 | April Fools' Problem (medium) | binary search flows graphs | Statement | N | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2500 | |
| 697 | Heidi and Library (hard) | flows graphs | Statement | A3 | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2600 | |
| 1560 | Card Game | binary search flows graphs | Statement | F | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2500 | |
| 1013 | Four Melodies | flows graphs | Statement | G | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2700 | |
| 472 | Maximum Flow | flows graphs | Statement | E | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 2900 | |
| 455 | Shake It! | combinatorics dp flows graphs | Statement | D | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2900 | |
| 1278 | Anti-Palindromize | flows graphs greedy | Statement | F | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2500 | |
| 681 | Yet Another Maxflow Problem | data structures flows graphs | Statement | G | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2700 | |
| 665 | Minimal k-covering | flows graphs | Statement | F | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2500 | |
| 1049 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 601 | Politics | flows graphs | Statement | E | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2800 | |
| 778 | Privatization of Roads in Berland | flows graphs | Statement | I | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2600 | |
| 2668 | Petya and Graph | flows graphs | Statement | G | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2400 | |
| 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 | |
| 1041 | Zoning Restrictions | dp flows graphs | Statement | G | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2600 | |
| 297 | Stock Exchange | binary search flows graphs | Statement | H | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 3500 | |
| 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 | |
| 685 | Gang Up | flows graphs | Statement | G | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2600 | |
| 1295 | Rectangle Painting 2 | flows graph matchings graphs | Statement | E | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2500 | |
| 317 | Projectors | flows graphs | Statement | K | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3200 | ||
| 641 | Road Construction | flows graphs | Statement | L | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 949 | Economic Difficulties | data structures dfs and similar dp flows graphs trees | Statement | F | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2500 | |
| 597 | Cow and Exercise | flows graphs shortest paths | Statement | G | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3000 |
| 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 | ||
| 436 | Special Edges | flows graphs | Statement | F | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 2250.0 | Codeforces Round #659 Editorial | |
| 1571 | Bricks | flows graph matchings graphs | Statement | E | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 3000.0 | Codeforces Round #668 Editorial | |
| 2092 | Valuable Paper | binary search flows graph matchings graphs | Statement | B | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 496 | One Billion Shades of Grey | flows graphs | Statement | G | Codeforces Global Round 11 {1427} | PROGRAMMING | 2250.0 | Editorial of Global Round 11 | 3300 |
| 708 | Starry Night Camping | flows graphs | Statement | G | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 3000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 2289 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 10073 | Secret Santa | constructive algorithms flows graphs math probabilities | Statement | D | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1500.0 | Codeforces Round #733 Editorial (all problems) | |
| 61 | Excursions | *special constructive algorithms dfs and similar flows graphs | Statement | I | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 26631 | Gregor and the Pawn Game | flows graphs greedy implementation | Statement | B | Codeforces Round 736 (Div. 2) {1549} | PROGRAMMING | 750.0 | Codeforces Round 736 Editorial | |
| 621 | Bridge Club | flows graphs greedy | Statement | D | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 2500.0 | Tutorial | 2800 |
| 384 | Reindeer Games | constructive algorithms flows graphs shortest paths | Statement | H | Codeforces Global Round 18 {1615} | PROGRAMMING | 4000.0 | Global Round 18 Editorial | |
| 919 | Making It Bipartite | flows graphs number theory | Statement | F | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #768 | |
| 297 | Training Camp | flows graphs | Statement | J | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 392 | MCMF? | data structures flows graphs greedy sortings two pointers | Statement | F | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2750.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 | ||
| 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 |
| 1311 | Double Sort II | dfs and similar flows graphs greedy | Statement | F | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 2712 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 1320 | Matrix Problem | flows graph matchings graphs | Statement | E | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 4506 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 103 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 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 | ||
| 146 | Variance Challenge | flows graphs greedy | Statement | I | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 5500.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 550 | For the Emperor! | flows graphs | Statement | D | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 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 | |
| 60 | Kevin and Stones (Hard Version) | flows graphs | Statement | H2 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 5000.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 | |
| 205 | Amusement Park Rides | flows graphs | Statement | K | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 270 | Penguin Steps | binary search dfs and similar flows graphs shortest paths | Statement | F | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 3000.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 565 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 185 | Maxflow GCD Coloring | flows graphs | Statement | H | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 5500.0 | ||
| 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 |