Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 981 | Embassy Queue | data structures greedy | Statement | B | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 1800 | |
| 590 | Competition | data structures greedy | Statement | E | Codeforces Round 103 (Div. 2) {144} | PROGRAMMING | 2300 | ||
| 197 | Wizards and Roads | data structures divide and conquer graph matchings graphs greedy | Statement | D | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | 2900 | ||
| 1100 | Range Increments | data structures greedy | Statement | C | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1800 | |
| 742 | Optimal Sum | data structures greedy | Statement | C | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 103 | Heaven Tour | data structures greedy | Statement | E | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 2800 | ||
| 931 | Fools and Foolproof Roads | data structures dfs and similar ds graphs greedy | Statement | D | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | 2500 | ||
| 5298 | Milking cows | data structures greedy | Statement | A | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 1500 | |
| 1390 | Cardboard Box | data structures greedy | Statement | E | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2500 | |
| 1810 | Artem and Array | data structures greedy | Statement | C | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 789 | Alex and Complicated Task | data structures dp greedy | Statement | E | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 2900 | |
| 2635 | Kindergarten | data structures dp greedy | Statement | D | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2400 | |
| 1759 | Bear and Bowling | data structures greedy | Statement | E | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 3100 | |
| 1263 | Frogs and mosquitoes | data structures greedy | Statement | F | Educational Codeforces Round 3 {609} | PROGRAMMING | 2500 | ||
| 347 | Frog Fights | data structures greedy | Statement | E | Codeforces Round 342 (Div. 2) {625} | PROGRAMMING | 2900 | ||
| 1176 | Package Delivery | data structures divide and conquer greedy | Statement | C | 8VC Venture Cup 2016 - Final Round {627} | PROGRAMMING | 2300 | ||
| 7481 | New Reform | data structures dfs and similar ds graphs greedy | Statement | E | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 1600 | |
| 1163 | Roads in Yusland | data structures dp greedy | Statement | D | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | 2800 | ||
| 415 | Organizing a Race | data structures greedy | Statement | E | Codeforces Round 352 (Div. 1) {671} | PROGRAMMING | 3300 | ||
| 2788 | Trains and Statistic | data structures dp greedy | Statement | E | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 2500 | |
| 462 | Huffman Coding on Segment | data structures greedy | Statement | D | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 3000 | ||
| 2810 | Contest Balloons | data structures greedy | Statement | D | Canada Cup 2016 {725} | PROGRAMMING | 1800 | ||
| 1137 | Heidi and Library (medium) | data structures greedy | Statement | B | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 1900 | |
| 3485 | Minimal Labels | data structures dfs and similar graphs greedy | Statement | E | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2400 | |
| 2392 | Driving Test | data structures dp greedy | Statement | D | Educational Codeforces Round 27 {845} | PROGRAMMING | 1800 | ||
| 1216 | Dog Show | data structures greedy | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2300 | ||
| 2037 | Boxes And Balls | data structures greedy | Statement | D | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2300 | |
| 3872 | Riverside Curio | data structures dp greedy | Statement | C | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1800 | |
| 368 | Fafa and Array | data structures greedy | Statement | F | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2800 | |
| 398 | Distinctification | data structures ds greedy | Statement | G | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2700 | |
| 2061 | Cloud Computing | data structures greedy | Statement | C | 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 | 2000 | |
| 652 | Berkomnadzor | data structures greedy | Statement | B | 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 | 2500 | |
| 260 | Secret Letters | data structures dp greedy | Statement | F | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2900 | |
| 512 | Train Car Selection | data structures greedy | Statement | E | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 4232 | Same Sum Blocks (Hard) | data structures greedy | Statement | F2 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2200 | |
| 13328 | Bad Sequence | data structures greedy | Statement | C | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1200 | |
| 2701 | Wi-Fi | data structures dp greedy | Statement | F | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 2969 | Workout plan | data structures greedy | Statement | F | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 1500 | |
| 6450 | Optimal Subsequences (Easy Version) | data structures greedy | Statement | D1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1600 | |
| 4409 | Optimal Subsequences (Hard Version) | data structures greedy | Statement | D2 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1800 | |
| 123 | Balanced Distribution | data structures dp greedy | Statement | G | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3600 | |
| 2363 | Voting (Easy Version) | data structures dp greedy | Statement | E1 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2200 | |
| 4264 | The Contest | data structures dp greedy | Statement | E | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2000 | |
| 3970 | Water Balance | data structures geometry greedy | Statement | C | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1250.0 | Codeforces Round #618 Editorial | 2100 |
| 1551 | Animal Observation (hard version) | data structures dp greedy | Statement | F2 | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1000.0 | Codeforces Round #620 (Div. 2) Editorial | 2600 |
| 6551 | Skyscrapers (hard version) | data structures dp greedy | Statement | C2 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1900 |
| 821 | Phoenix and Memory | data structures dfs and similar graphs greedy | Statement | F | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 3000.0 | Codeforces Round #638 (Div. 2) Editorial | 2600 |