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
< 1 2 3 4 5 6 7 ... 11 12 13 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 10169 | Regular Bracket Sequence | greedy implementation | Statement | A | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 1100 | |
| 2256 | Stressful Training | binary search greedy | Statement | D | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2300 | |
| 1957 | Knapsack | dfs and similar dp greedy | Statement | E | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2400 | |
| 1226 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 13970 | Discounts | greedy sortings | Statement | B | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 900 | |
| 3797 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar dsu graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 | |
| 3991 | Nastya Is Buying Lunch | greedy | Statement | D | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1800 | |
| 6993 | Camp Schedule | greedy hashing strings | Statement | B | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 598 | Train Car Selection | data structures greedy | Statement | E | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 4199 | Circus | brute force greedy math strings | Statement | B | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 21939 | Sushi for Two | binary search greedy implementation | Statement | A | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 900 | |
| 19329 | Chocolates | greedy implementation | Statement | B | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1100 | |
| 13145 | Minimum Triangulation | dp greedy math | Statement | D | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 8951 | Colored Boots | greedy implementation | Statement | D | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1500 | |
| 4152 | Same Sum Blocks (Easy) | greedy | Statement | F1 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2000 | |
| 4570 | Same Sum Blocks (Hard) | data structures greedy | Statement | F2 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2200 | |
| 2542 | Privatization of Roads in Treeland | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | G | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2500 | |
| 18309 | Parity Alternated Deletions | greedy implementation sortings | Statement | B | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1000 | |
| 10825 | Equalize Them All | constructive algorithms greedy | Statement | D | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1400 | |
| 2336 | Two Merged Sequences | dp greedy | Statement | G | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 2600 | |
| 5258 | Dirty Deeds Done Dirt Cheap | greedy sortings | Statement | D | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 1800 | |
| 1819 | Earth Wind and Fire | constructive algorithms greedy math sortings two pointers | Statement | E | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 2300 | |
| 15513 | Another One Bites The Dust | greedy | Statement | A | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 700 | |
| 17778 | Prefix Sum Primes | constructive algorithms greedy math number theory | Statement | A | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 1300 | |
| 962 | Abandoning Roads | brute force dp graphs greedy | Statement | D | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 11836 | Tiling Challenge | greedy implementation | Statement | B | Codeforces Round 556 (Div. 2) {1150} | PROGRAMMING | 66783 | 1100 | |
| 12509 | Stock Arbitraging | greedy implementation | Statement | A | Codeforces Round 556 (Div. 2) {1150} | PROGRAMMING | 66783 | 900 | |
| 9053 | Stas and the Queue at the Buffet | greedy math sortings | Statement | D | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1500 | |
| 2577 | Neko and Aki's Prank | dp greedy trees | Statement | D | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2000 | |
| 16195 | Neko Finds Grapes | greedy implementation math | Statement | A | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 800 | |
| 9399 | Serval and Toy Bricks | constructive algorithms greedy | Statement | B | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1200 | |
| 7789 | Serval and Parenthesis Sequence | greedy strings | Statement | C | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1600 | |
| 5521 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 10538 | Walking Robot | greedy | Statement | D | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1400 | |
| 3246 | Shovels Shop | dp greedy sortings | Statement | F | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 2300 | |
| 3247 | Minimum Possible LCM | brute force greedy math number theory | Statement | G | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 2400 | |
| 12514 | Game with Telephone Numbers | games greedy implementation | Statement | B | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1200 | |
| 7702 | Beautiful Array | brute force data structures divide and conquer dp greedy | Statement | D | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1900 | |
| 6569 | Ugly Pairs | dfs and similar greedy implementation sortings strings | Statement | B | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 1800 | |
| 6654 | Match Points | binary search greedy sortings ternary search two pointers | Statement | C | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2000 | |
| 156 | Optimizer | graphs greedy hashing implementation | Statement | G | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 3100 | |
| 15616 | Long Number | greedy | Statement | B | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1300 | |
| 13436 | Increasing Subsequence (easy version) | greedy | Statement | C1 | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1300 | |
| 9173 | Minimum Array | binary search data structures greedy | Statement | E | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 9066 | Increasing Subsequence (hard version) | greedy | Statement | C2 | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 3991 | N Problems During K Days | constructive algorithms greedy math | Statement | D | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2100 | |
| 2877 | Maximum Balanced Circle | constructive algorithms dp greedy two pointers | Statement | F | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2300 | |
| 8308 | The Party and Sweets | binary search constructive algorithms greedy implementation math sortings two pointers | Statement | A | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 1500 | |
| 2114 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 927 | Winding polygonal line | constructive algorithms geometry greedy math | Statement | D | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2800 | |
| 6047 | Double Matrix | brute force greedy | Statement | B | Codeforces Round 557 (Div. 2) [based on Forethought Future Cup - Final Round] {1162} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 1400 | |
| 13846 | Eating Soup | greedy math | Statement | A | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 1000 | |
| 24125 | Polycarp Training | data structures greedy sortings | Statement | B | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1000 | |
| 14355 | Good String | greedy | Statement | C | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1300 | |
| 9894 | Two Arrays and Sum of Functions | greedy math sortings | Statement | E | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1800 | |
| 2144 | Microtransactions (easy version) | binary search greedy | Statement | F1 | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 2400 | |
| 2446 | Microtransactions (hard version) | binary search greedy implementation | Statement | F2 | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 2400 | |
| 2282 | Cute Sequences | binary search brute force greedy math | Statement | D | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2100 | |
| 15057 | Silent Classroom | combinatorics greedy | Statement | A | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 900 | |
| 7366 | Bicolored RBS | constructive algorithms greedy | Statement | D | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1500 | |
| 20263 | Telephone Number | brute force greedy strings | Statement | A | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 700 | |
| 7579 | Increasing by Modulo | binary search greedy | Statement | A | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 1800 | |
| 135 | Wheels | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 5173 | Nauuo and Cards | greedy implementation | Statement | A | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 1800 | |
| 9438 | Nauuo and Chess | constructive algorithms greedy | Statement | B | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 1100 | |
| 17245 | Nauuo and Votes | greedy | Statement | A | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 700 | |
| 19186 | Ehab Fails to Be Thanos | constructive algorithms greedy sortings | Statement | A | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1000 | |
| 7256 | Electrification | binary search brute force greedy | Statement | C | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1600 | |
| 7040 | Array Splitting | greedy sortings | Statement | D | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1900 | |
| 4517 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 | |
| 15082 | Lose it! | dp greedy implementation | Statement | C | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1300 | |
| 5689 | Recover it! | dfs and similar graphs greedy number theory sortings | Statement | D | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1900 | |
| 24926 | Divide it! | brute force greedy implementation | Statement | A | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 800 | |
| 11278 | Prime Minister | greedy | Statement | A | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1100 | |
| 13170 | Tiles | combinatorics greedy math | Statement | C | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 7903 | Prime Graph | constructive algorithms greedy math number theory | Statement | D | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1600 | |
| 4502 | Archaeology | brute force constructive algorithms greedy strings | Statement | E | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1900 | |
| 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 | |
| 10080 | Nick and Array | greedy implementation | Statement | B | Codeforces Round 569 (Div. 2) {1180} | PROGRAMMING | Editorial of Round #569 | 1500 | |
| 14774 | Chunga-Changa | greedy math | Statement | A | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1000 | |
| 6606 | Split a Number | greedy implementation strings | Statement | B | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1500 | |
| 395 | A Story of One Country (Hard) | brute force greedy sortings | Statement | E2 | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 3000 | |
| 4588 | Beautiful Lyrics | data structures greedy strings | Statement | C | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1700 | |
| 20278 | Candy Box (easy version) | greedy sortings | Statement | D | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 2663 | Candy Box (hard version) | greedy implementation sortings | Statement | G | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2100 | |
| 11885 | Exam in BerSU (easy version) | greedy sortings | Statement | C1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1200 | |
| 7808 | Exam in BerSU (hard version) | brute force data structures greedy math | Statement | C2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1700 | |
| 9303 | Vus the Cossack and Numbers | constructive algorithms greedy math | Statement | D | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 1600 | |
| 994 | Vus the Cossack and a Graph | dfs and similar graphs greedy implementation | Statement | F | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 2300 | |
| 6753 | Vasya And Array | constructive algorithms greedy implementation | Statement | C | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 1800 | |
| 15285 | Number Circle | greedy math sortings | Statement | B | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 1100 | |
| 2215 | Tokitsukaze and Duel | brute force games greedy | Statement | C | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2400 | |
| 262 | Tokitsukaze and Explosion | binary search greedy | Statement | E | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3100 | |
| 14180 | Drinks Choosing | greedy math | Statement | A | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 14496 | Pillars | greedy implementation | Statement | B | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1000 | |
| 14027 | DIY Wooden Ladder | greedy math sortings | Statement | A | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1000 | |
| 15230 | Array Splitting | greedy sortings | Statement | C | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1400 | |
| 5774 | Yet Another Subarray Problem | dp greedy math | Statement | D | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1900 | |
| 4045 | Matching vs Independent Set | constructive algorithms graphs greedy sortings | Statement | C | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2200 | |
| 1075 | GCD Groups 2 | greedy number theory probabilities | Statement | F | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2900 | |
| 14648 | Block Adventure | dp greedy | Statement | B | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1300 | |
| 32761 | Maximum Median | binary search greedy math sortings | Statement | C | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1400 | |
| 25276 | Zero Array | greedy math | Statement | B | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1500 | |
| 2531 | Treasure Hunting | binary search dp greedy implementation | Statement | D | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2000 | |
| 10703 | You Are Given Two Binary Strings... | bitmasks greedy | Statement | A | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1100 | |
| 2763 | You Are Given a WASD-string... | brute force data structures dp greedy implementation math strings | Statement | C | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2100 | |
| 16898 | Equal Rectangles | greedy math | Statement | B | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1200 | |
| 14938 | Boxers | greedy sortings | Statement | E | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1500 | |
| 9470 | Remove the Substring (easy version) | greedy implementation | Statement | D1 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1600 | |
| 8099 | Remove the Substring (hard version) | binary search greedy implementation two pointers | Statement | D2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1800 | |
| 4038 | Complete the Projects (easy version) | greedy | Statement | F1 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2100 | |
| 3294 | Complete the Projects (hard version) | dp greedy | Statement | F2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2400 | |
| 18318 | Mislove Has Lost an Array | greedy math | Statement | B | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1000 | |
| 7197 | Anna, Svyatoslav and Maps | dp graphs greedy shortest paths | Statement | C | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1700 | |
| 3218 | Kirk and a Binary String (easy version) | brute force greedy strings | Statement | D1 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2000 | |
| 3390 | Kirk and a Binary String (hard version) | data structures greedy math strings | Statement | D2 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2100 | |
| 14695 | Almost Equal | constructive algorithms greedy math | Statement | A | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1300 | |
| 13749 | Square Filling | constructive algorithms greedy implementation | Statement | B | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1200 | |
| 10418 | Gas Pipeline | dp greedy | Statement | C | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1500 | |
| 23369 | There Are Two Types Of Burgers | brute force greedy implementation math | Statement | A | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 700 | |
| 5439 | Restore Permutation | binary search data structures greedy implementation | Statement | D | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1900 | |
| 3289 | Bits And Pieces | bitmasks dfs and similar dp greedy | Statement | F | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2600 | |
| 926 | Polygons | greedy math number theory | Statement | G | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2700 | |
| 7852 | Paint the Digits | constructive algorithms greedy implementation | Statement | C | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1600 | |
| 3244 | Rotate Columns (easy version) | bitmasks brute force dp greedy sortings | Statement | E1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 3934 | Into Blocks (easy version) | data structures dsu greedy implementation two pointers | Statement | G1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 2296 | Rotate Columns (hard version) | bitmasks dp greedy sortings | Statement | E2 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2400 | |
| 228 | Moving Walkways | data structures greedy math | Statement | H | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 3300 | |
| 12832 | Paint the Numbers | greedy implementation math | Statement | A | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 900 | |
| 6036 | Marcin and Training Camp | brute force greedy | Statement | B | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1800 | |
| 565 | Ice Cream | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2000 | |
| 216 | Double Permutation Inc. | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 252 | Teams | *special binary search greedy math | Statement | D | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 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 | |
| 14177 | Bad Sequence | data structures greedy | Statement | C | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1200 | |
| 502 | Employment | greedy sortings | Statement | F | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 12172 | Yellow Cards | greedy implementation math | Statement | A | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1000 | |
| 11923 | Swap Letters | constructive algorithms greedy | Statement | C | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 6555 | Ticket Game | games greedy math | Statement | D | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1700 | |
| 19636 | Shooting | greedy implementation sortings | Statement | B | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1000 | |
| 3092 | Wi-Fi | data structures dp greedy | Statement | F | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 11844 | Zmei Gorynich | greedy math | Statement | B | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 2061 | Sum Queries? | data structures greedy implementation math | Statement | E | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2300 | |
| 3185 | Workout plan | data structures greedy | Statement | F | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 1500 | |
| 734 | The Light Square | 2-sat dfs and similar greedy | Statement | I | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2200 | |
| 10801 | Substring Game in the Lesson | games greedy strings | Statement | C | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1300 | |
| 2999 | Tourism | dfs and similar dp dsu graphs greedy trees | Statement | E | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2200 | |
| 18139 | 2048 Game | brute force greedy math | Statement | A | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1000 | |
| 12514 | Knights | constructive algorithms greedy | Statement | B | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1100 | |
| 9744 | Save the Nature | binary search greedy | Statement | C | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 1600 | |
| 4426 | Sequence Sorting | dp greedy two pointers | Statement | D | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2000 | |
| 990 | Tree Factory | constructive algorithms greedy trees | Statement | F | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2500 | |
| 658 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 6823 | Optimal Subsequences (Easy Version) | data structures greedy | Statement | D1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1600 | |
| 4720 | Optimal Subsequences (Hard Version) | data structures greedy | Statement | D2 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1800 | |
| 19616 | Ania and Minimizing | greedy implementation | Statement | B | Codeforces Round 588 (Div. 2) {1230} | PROGRAMMING | 70008 | 1000 | |
| 4360 | Increasing Matrix | greedy | Statement | C | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1100 | |
| 932 | Middle-Out | constructive algorithms greedy strings | Statement | E | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2000 | |
| 10542 | Labs | constructive algorithms greedy implementation | Statement | C | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 1300 | |
| 1736 | Alice and the Doll | brute force data structures greedy implementation | Statement | D | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2100 | |
| 17237 | Stones | brute force greedy math | Statement | A | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 800 | |
| 6297 | Balanced Removals (Easier) | constructive algorithms geometry greedy | Statement | C1 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1600 | |
| 4532 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 165 | Balanced Distribution | data structures dp greedy | Statement | G | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3600 | |
| 14757 | Kill `Em All | greedy sortings | Statement | B | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1300 | |
| 7840 | Standard Free2play | dp greedy math | Statement | C | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1600 | |
| 493 | Adilbek and the Watering System | data structures greedy sortings | Statement | G | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2700 | |
| 1810 | Queue in the Train | data structures greedy implementation | Statement | C | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2300 | |
| 6385 | Minimizing Difference | binary search constructive algorithms greedy sortings ternary search two pointers | Statement | E | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2000 | |
| 1519 | Running in Pairs | constructive algorithms greedy math | Statement | G | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2500 | |
| 14515 | Restricted RPS | constructive algorithms dp greedy | Statement | B | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1200 | |
| 9529 | Shichikuji and Power Grid | dsu graphs greedy shortest paths trees | Statement | D | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1900 | |
| 2519 | The World Is Just a Programming Task (Easy Version) | brute force dp greedy implementation | Statement | D1 | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1900 | |
| 17992 | Grow The Tree | greedy math sortings | Statement | B | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 900 | |
| 16526 | Good Numbers (easy version) | brute force greedy implementation | Statement | C1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1300 | |
| 13511 | Good Numbers (hard version) | binary search greedy math meet-in-the-middle | Statement | C2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1500 | |
| 5495 | Too Many Segments (easy version) | greedy | Statement | D1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1900 | |
| 5760 | Too Many Segments (hard version) | data structures greedy sortings | Statement | D2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2000 | |
| 4684 | Divide The Students | binary search greedy math | Statement | L | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1700 | ||
| 3242 | The Parade | binary search greedy | Statement | J | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 2798 | The Feast and the Bus | brute force constructive algorithms greedy math | Statement | B | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 1750 | Wires | dfs and similar graphs greedy | Statement | N | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2200 | ||
| 774 | Discarding Game | dp greedy two pointers | Statement | G | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2400 | ||
| 171 | Show Must Go On | binary search brute force greedy shortest paths | Statement | I | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 11610 | Binary Palindromes | greedy strings | Statement | B | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1400 | |
| 14304 | Minimize The Integer | greedy two pointers | Statement | C | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1500 | |
| 6456 | Salary Changing | binary search greedy sortings | Statement | D | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1800 | |
| 2585 | Voting (Easy Version) | data structures dp greedy | Statement | E1 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2200 | |
| 2947 | Voting (Hard Version) | binary search data structures greedy | Statement | E2 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2300 | |
| 2846 | Twin Buildings | greedy implementation | Statement | H | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1900 | |
| 1359 | Songwriter | greedy two pointers | Statement | E | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2300 | |
| 11700 | Silly Mistake | greedy implementation | Statement | B | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1400 | |
| 15284 | Sweets Eating | dp greedy math sortings | Statement | C | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1500 | |
| 10229 | Harmonious Graph | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | D | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1700 | |
| 3057 | Antenna Coverage | data structures dp greedy sortings | Statement | E | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2200 | |
| 5512 | Feeding Chicken | constructive algorithms greedy implementation | Statement | A | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 1900 | |
| 5004 | Send Boxes to Alice (Easy Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B1 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2000 | |
| 3416 | Send Boxes to Alice (Hard Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B2 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2100 | |
| 13663 | Minimize the Permutation | greedy | Statement | B | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1400 | |
| 12740 | Binary String Minimizing | greedy | Statement | D | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1500 | |
| 7315 | Platforms Jumping | greedy | Statement | C | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1700 | |
| 4595 | Yet Another Division Into Teams | dp greedy sortings | Statement | E | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 17123 | Dominated Subarray | greedy implementation sortings strings two pointers | Statement | C | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1200 | |
| 8144 | Yet Another Monster Killing Problem | binary search data structures dp greedy sortings two pointers | Statement | D | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1700 | |
| 4525 | The Contest | data structures dp greedy | Statement | E | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2000 | |
| 730 | Divisor Set | divide and conquer fft greedy math number theory | Statement | G | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2700 | |
| 21657 | Two Rival Students | greedy math | Statement | A | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 700 | |
| 8773 | Infinite Fence | greedy math number theory | Statement | C | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1700 | |
| 4180 | A Game with Traps | binary search dp greedy sortings | Statement | D | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1900 | |
| 1883 | Tournament | brute force dp greedy | Statement | E | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2400 | |
| 11803 | PIN Codes | greedy implementation | Statement | B | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 | |
| 10436 | Beautiful Regional Contest | greedy implementation | Statement | A | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1500 | |
| 6044 | Beautiful Sequence | brute force constructive algorithms greedy | Statement | B | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1900 | |
| 15923 | Beautiful String | constructive algorithms greedy | Statement | A | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1000 | |
| 10053 | Diverse Matrix | constructive algorithms greedy math number theory | Statement | C | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1400 | |
| 3868 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 2348 | Spaceship Solitaire | data structures greedy implementation | Statement | E | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2100 | |
| 3504 | Elections | greedy | Statement | E | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1700 | |
| 3055 | Just Arrange the Icons | greedy implementation math | Statement | J | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1900 | |
| 9060 | Long Beautiful Integer | constructive algorithms greedy implementation strings | Statement | A | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 1700 | |
| 6423 | Domino for Young | dp greedy math | Statement | B | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2000 | |
| 17341 | Interesting Subarray | constructive algorithms greedy math | Statement | B | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1300 | |
| 17804 | Card Game | games greedy math | Statement | A | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 700 | |
| 11043 | Shawarma Tent | brute force geometry greedy implementation | Statement | C | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 12088 | Blocks | greedy math | Statement | B | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 3395 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 15662 | Suits | brute force greedy math | Statement | A | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 900 | |
| 14667 | Snow Walking Robot | constructive algorithms greedy implementation | Statement | B | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1200 | |
| 22043 | Three Friends | brute force greedy math sortings | Statement | A | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 900 | |
| 12938 | As Simple as One and Two | dp greedy | Statement | A | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1300 | |
| 1776 | Beautiful Rectangle | brute force combinatorics constructive algorithms data structures greedy math | Statement | C | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2300 | |
| 16974 | Make Them Odd | greedy number theory | Statement | B | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1200 | |
| 14156 | A and B | greedy math | Statement | B | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1500 | |
| 8575 | Berry Jam | data structures dp greedy implementation | Statement | C | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1600 | |
| 3038 | Jeremy Bearimy | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2000 | |
| 1228 | Miss Punyverse | dp greedy trees | Statement | D | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2700 | |
| 8681 | Azamon Web Services | greedy | Statement | B | Codeforces Round 607 (Div. 2) {1281} | PROGRAMMING | Codeforces Round #607 Editorial | 1500 | |
| 12141 | K for the Price of One (Easy Version) | dp greedy sortings | Statement | B1 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1400 | |
| 11000 | K for the Price of One (Hard Version) | dp greedy sortings | Statement | B2 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1600 | |
| 4578 | Petya and Exam | greedy sortings two pointers | Statement | C | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1800 | |
| 7285 | New Year Parties | dp greedy | Statement | E | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 9405 | Christmas Trees | graphs greedy shortest paths | Statement | D | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 2034 | DIY Garland | constructive algorithms greedy trees | Statement | F | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 2400 | |
| 30624 | Just Eat It! | dp greedy implementation | Statement | B | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1300 | |
| 8588 | Dr. Evil Underscores | bitmasks brute force dfs and similar divide and conquer dp greedy strings trees | Statement | D | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1800 | |
| 9624 | Garland | dp greedy sortings | Statement | A | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 1700 | |
| 5454 | Numbers on Tree | constructive algorithms data structures dfs and similar graphs greedy trees | Statement | B | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2000 | |
| 21915 | Angry Students | greedy implementation | Statement | A | Codeforces Round 612 (Div. 2) {1287} | PROGRAMMING | Codeforces Round #612 - Editorial | 800 | |
| 20659 | Even But Not Even | greedy math strings | Statement | A | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1000 |
| 15345 | Array Sharpening | greedy implementation | Statement | B | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1300 |