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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3620 | Equalizing Two Strings | constructive algorithms sortings strings | Statement | F | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 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 | |
| 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 | |
| 1068 | Intriguing Selection | brute force constructive algorithms implementation interactive sortings | Statement | I | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2700 | |
| 9613 | Modulo Equality | brute force sortings | Statement | B | Codeforces Round 609 (Div. 2) {1269} | PROGRAMMING | Codeforces Round #609 — Editorial | 1500 | |
| 4862 | Strange Device | constructive algorithms interactive math sortings | Statement | D | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1900 | |
| 3395 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 22043 | Three Friends | brute force greedy math sortings | Statement | A | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 900 | |
| 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 | |
| 11446 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 3390 | New Year and Conference | binary search data structures hashing sortings | Statement | D | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2100 | |
| 1377 | New Year and Castle Construction | combinatorics geometry math sortings | Statement | E | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2500 | |
| 2000 | Delete a Segment | brute force constructive algorithms data structures dp graphs sortings trees two pointers | Statement | E | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2300 | |
| 9624 | Garland | dp greedy sortings | Statement | A | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 1700 | |
| 22898 | Collecting Packages | implementation sortings | Statement | B | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1200 | |
| 15074 | Fight with Monsters | greedy sortings | Statement | D | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1500 | |
| 8192 | String Coloring (easy version) | constructive algorithms dp graphs greedy sortings | Statement | E1 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1800 | |
| 3086 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 274 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 127 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 429 | Cartoons | *special implementation sortings | Statement | B | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 25867 | Assigning to Classes | greedy implementation sortings | Statement | B | Codeforces Round 618 (Div. 2) {1300} | PROGRAMMING | 750.0 | Codeforces Round #618 Editorial | 1000 |
| 17719 | Air Conditioner | dp greedy implementation sortings two pointers | Statement | C | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1500.0 | Codeforces Round #620 (Div. 2) Editorial | 1500 |
| 14639 | Kuroni and the Gifts | brute force constructive algorithms greedy sortings | Statement | A | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 500.0 | Ozon Tech Challenge 2020 Editorial | 800 |
| 7159 | Cow and Fields | binary search data structures dfs and similar graphs greedy shortest paths sortings | Statement | D | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1900 |
| 5577 | Recommendations | data structures greedy sortings | Statement | A | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1700 |
| 20013 | WeirdSort | dfs and similar sortings | Statement | B | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1200 | |
| 4810 | Moving Points | data structures divide and conquer implementation sortings | Statement | F | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2100 | |
| 38725 | Bogosort | constructive algorithms sortings | Statement | B | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 11719 | String Modification | brute force constructive algorithms implementation sortings strings | Statement | B | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1000.0 | Codecraft-20 (Div.2) Editorial | 1400 |
| 5331 | Team Building | bitmasks dp greedy sortings | Statement | E | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2250.0 | Codecraft-20 (Div.2) Editorial | 2300 |
| 21554 | Journey Planning | data structures math sortings | Statement | A | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 500.0 | Codeforces Round #625 Editorial | |
| 3424 | World of Darkraft: Battle for Azathoth | data structures sortings | Statement | C | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 1500.0 | Codeforces Round #625 Editorial | |
| 4622 | Present | binary search bitmasks constructive algorithms data structures math sortings | Statement | B | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 33919 | Pair of Topics | binary search data structures sortings two pointers | Statement | D | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 1802 | Drazil Likes Heap | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 1500.0 | Codeforces Round #631 Editorial | 2400 |
| 4128 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 4566 | Kate and imperfection | greedy implementation math number theory sortings two pointers | Statement | F | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 27573 | Middle Class | greedy sortings | Statement | B | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 38877 | Two Teams Composing | binary search greedy implementation sortings | Statement | C | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1100 | |
| 24558 | Linova and Kingdom | dfs and similar dp greedy sortings trees | Statement | A | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1700 |
| 12116 | Xenia and Colorful Gems | binary search greedy math sortings two pointers | Statement | B | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 750.0 | Codeforces Round #635 Editorial | 1800 |
| 28289 | Sorted Adjacent Differences | constructive algorithms sortings | Statement | B | Codeforces Round 633 (Div. 2) {1339} | PROGRAMMING | 750.0 | Codeforces Round #633 Editorial | |
| 6362 | Multiple Testcases | binary search constructive algorithms data structures greedy sortings two pointers | Statement | D | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1900 | |
| 5715 | Weights Distributing | brute force graphs greedy shortest paths sortings | Statement | E | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 2400 | |
| 16482 | Hilbert's Hotel | math number theory sortings | Statement | A | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 500.0 | Codeforces Round #639 Editorial | 1600 |
| 677 | Spring Cleaning | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1600 | |
| 20228 | Constructing the Array | constructive algorithms data structures sortings | Statement | D | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1600 | |
| 57900 | Two Arrays And Swaps | greedy sortings | Statement | B | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 800 | |
| 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 | |
| 27337 | Young Explorers | dp greedy sortings | Statement | B | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 750.0 | Codeforces Round #643 (Div. 2) Editorial | 1200 |
| 5824 | Restorer Distance | binary search greedy math sortings ternary search | Statement | E | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 2000.0 | Codeforces Round #643 (Div. 2) Editorial | 2100 |
| 25857 | Maria Breaks the Self-isolation | greedy sortings | Statement | B | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 750.0 | Codeforces Round #645 (Div. 2) Editorial | 1000 |
| 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 | |
| 53549 | Honest Coach | greedy sortings | Statement | B | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 800 | |
| 8757 | Johnny and Contribution | constructive algorithms graphs greedy sortings | Statement | A | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 500.0 | Codeforces Round #647 Editorial | 1700 |
| 3843 | Johnny and Grandmaster | greedy implementation math sortings | Statement | B | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 1250.0 | Codeforces Round #647 Editorial | 1900 |
| 4740 | Swaps Again | constructive algorithms implementation sortings | Statement | F | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 2500.0 | Editorial — Codeforces Round #648 | 2100 |
| 8768 | Task On The Board | constructive algorithms greedy implementation sortings | Statement | D | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 20839 | RationalLee | greedy math sortings | Statement | C | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 1500.0 | Codeforces Round #652 (Div. 2) Editorial | 1400 |
| 2450 | DeadLee | constructive algorithms data structures graphs greedy implementation sortings | Statement | E | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2500.0 | Codeforces Round #652 (Div. 2) Editorial | 2400 |
| 10812 | Odd-Even Subsequence | binary search dp greedy implementation sortings | Statement | D | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 2510 | Asterism (Hard Version) | binary search math number theory sortings | Statement | E2 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 5523 | Asterism (Easy Version) | brute force combinatorics implementation math number theory sortings | Statement | E1 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 1063 | Reading Books (hard version) | binary search data structures greedy sortings ternary search two pointers | Statement | E2 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 14943 | Reading Books (easy version) | data structures greedy implementation sortings | Statement | E1 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 30895 | Zero Remainder Array | math sortings two pointers | Statement | D | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 3368 | Inversion SwapSort | constructive algorithms greedy sortings | Statement | E | Codeforces Global Round 9 {1375} | PROGRAMMING | 2000.0 | 79731 | |
| 6072 | Choosing flowers | binary search data structures greedy math sortings two pointers | Statement | C | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1250.0 | Codeforces Round #657 Editorial | 2000 |
| 1149 | New Passenger Trams | brute force data structures sortings two pointers | Statement | D | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2400 |
| 22651 | Create The Teams | dp greedy sortings | Statement | C | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 1708 | Mastermind | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2000.0 | Codeforces Round #658 Editorial | 2500 |
| 278 | Origami | geometry math sortings | Statement | E | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 3000.0 | Codeforces Round #658 Editorial | 3300 |
| 759 | Rearrange | brute force constructive algorithms graphs greedy sortings | Statement | D | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 11243 | String Transformation 1 | dsu graphs greedy sortings strings trees | Statement | A | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 141 | Mixture | *special data structures geometry math sortings | Statement | B | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 647 | Uncle Bogdan and Projections | data structures geometry sortings | Statement | E | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2750.0 | Codeforces Round #660 Editorial | 2700 |
| 1240 | Bicolored Segments | data structures dp graph matchings greedy sortings | Statement | F | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 11042 | Pinkie Pie Eats Patty-cakes | binary search constructive algorithms data structures greedy math sortings | Statement | C | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 7111 | Boboniu Chats with Du | brute force dp greedy sortings two pointers | Statement | A | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1800 |
| 1221 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 2592 | Two Types of Spells | binary search data structures greedy implementation math sortings | Statement | E | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 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 | ||
| 25854 | Substring Removal Game | games greedy sortings strings | Statement | B | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1857 | Yet Another Segments Subset | dp sortings | Statement | F | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 80180 | Remove Smallest | greedy sortings | Statement | A | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 6265 | Clear the Multiset | divide and conquer dp greedy sortings | Statement | E | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 10501 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 26749 | Mere Array | constructive algorithms math number theory number theory sortings sortings | Statement | C | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 2628 | Divide Square | data structures divide and conquer geometry implementation sortings | Statement | E | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 1349 | Fancy Fence | *special data structures dp dsu math sortings | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 129 | Roads | *special geometry sortings | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 312 | The Potion of Great Power | *special binary search data structures graphs interactive sortings two pointers | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 24421 | Maximum Product | brute force dp greedy implementation sortings | Statement | B | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 4666 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 2176 | Avoid Rainbow Cycles | dsu graphs greedy sortings | Statement | E | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 8444 | Two Platforms | binary search dp sortings two pointers | Statement | E | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 6213 | Perform Easily | data structures dp implementation sortings two pointers | Statement | C | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 1500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 15062 | Two Arrays | greedy math sortings | Statement | B | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 1100 |
| 17507 | Negative Prefixes | greedy sortings | Statement | B | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 17367 | Sage's Birthday (hard version) | binary search constructive algorithms greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1000.0 | Codeforces Round #671 Editorial | |
| 561 | Rain of Fire | binary search dfs and similar dsu graphs implementation sortings | Statement | F | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 3000.0 | Codeforces Round #671 Editorial | |
| 26357 | Sage's Birthday (easy version) | binary search greedy implementation sortings | Statement | D1 | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 750.0 | Codeforces Round #671 Editorial | |
| 8310 | Rescue Nibel! | combinatorics data structures sortings | Statement | D | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 2000.0 | Editorial | |
| 25167 | Cubes Sorting | math sortings | Statement | A | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 500.0 | Editorial | |
| 3117 | Returning Home | data structures graphs implementation shortest paths sortings | Statement | D | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1500.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 612 | Ancient Language | graphs sortings | Statement | M | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2] {1424} | PROGRAMMING | |||
| 6663 | Years | sortings | Statement | G | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2] {1424} | PROGRAMMING | |||
| 11438 | Chess Cheater | greedy implementation sortings | Statement | B | Codeforces Global Round 11 {1427} | PROGRAMMING | 750.0 | Editorial of Global Round 11 | 1400 |
| 18014 | Avoiding Zero | math sortings | Statement | A | Codeforces Global Round 11 {1427} | PROGRAMMING | 500.0 | Editorial of Global Round 11 | 900 |
| 20188 | Barrels | greedy implementation sortings | Statement | B | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 2646 | Complicated Computations | binary search data structures sortings two pointers | Statement | E | Codeforces Round 678 (Div. 2) {1436} | PROGRAMMING | 2500.0 | Codeforces Round #678 (Div. 2). Editorial | |
| 28847 | Valerii Against Everyone | constructive algorithms greedy sortings | Statement | B | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 750.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 16744 | The Delivery Dilemma | binary search greedy sortings | Statement | C | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 16547 | Saving the City | greedy math sortings | Statement | B | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 20339 | Array Rearrangment | greedy sortings | Statement | A | Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) {1445} | PROGRAMMING | 500.0 | Codeforces Round #680 Editorial | |
| 17642 | Knapsack | constructive algorithms greedy sortings | Statement | A | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 500.0 | E | |
| 18475 | Avoid Trygub | constructive algorithms sortings | Statement | A | Codeforces Global Round 12 {1450} | PROGRAMMING | 500.0 | Codeforces Global Round 12 Editorial | |
| 15460 | Toy Blocks | binary search greedy math sortings | Statement | B | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 13188 | Sequence and Swaps | dp greedy sortings | Statement | D | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 10169 | Divide and Summarize | binary search brute force data structures divide and conquer implementation sortings | Statement | D | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1500.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 11337 | Close Tuples (hard version) | binary search combinatorics implementation math sortings two pointers | Statement | E2 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 15198 | Close Tuples (easy version) | binary search combinatorics math sortings two pointers | Statement | E1 | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 8371 | The Treasure of The Segments | binary search data structures greedy sortings | Statement | F | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 5266 | Firecrackers | binary search sortings | Statement | D | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 29220 | Strange Birthday Party | dp greedy sortings two pointers | Statement | A | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 500.0 | 86464 | |
| 8836 | Correct Placement | binary search data structures sortings two pointers | Statement | E | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 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 | ||
| 30452 | Even-Odd Game | dp games greedy sortings | Statement | D | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 37276 | Replacing Elements | greedy implementation sortings | Statement | A | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 14107 | Array Destruction | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1500.0 | Codeforces Round #696 Editorial | |
| 11170 | Cleaning the Phone | binary search dp greedy sortings two pointers | Statement | D | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 17561 | Advertising Agency | combinatorics implementation math sortings | Statement | E | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 2717 | Pattern Matching | bitmasks data structures dfs and similar graphs sortings strings | Statement | E | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 2581 | Nezzar and Nice Beatmap | constructive algorithms geometry greedy sortings | Statement | C | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 1500.0 | 87294 | 2200 |
| 10616 | Nezzar and Symmetric Array | constructive algorithms implementation math sortings | Statement | C | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 1500.0 | Tutorial | 1700 |
| 2326 | Copy or Prefix Sum | combinatorics data structures dp sortings | Statement | F | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #701 (Div. 2) | 2400 |
| 20374 | Eastern Exhibition | geometry shortest paths sortings | Statement | B | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 1000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 5113 | Cheap Dinner | data structures dp implementation sortings two pointers | Statement | E | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 27490 | Arena | implementation sortings | Statement | A | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 18297 | Equalize the Array | binary search data structures greedy math sortings | Statement | F | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 5726 | GCD of an Array | data structures math number theory sortings two pointers | Statement | D | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 2250.0 | Codeforces Round #705 (Div.2) Editorial | |
| 17867 | Diamond Miner | geometry greedy math sortings | Statement | A | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 26017 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 2110 | Two Houses | brute force combinatorics graphs interactive probabilities sortings | Statement | E | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 910 | Matrix Sorting | bitmasks constructive algorithms dfs and similar greedy hashing string suffix structures two pointers | Statement | C | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 1500.0 | Codeforces Round #707 Editorial | 2600 |
| 21027 | Napoleon Cake | dp implementation sortings | Statement | B | Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics) {1501} | PROGRAMMING | 1000.0 | Codeforces Round #707 Editorial | 900 |
| 3838 | Travelling Salesman Problem | binary search data structures dp greedy shortest paths sortings | Statement | C | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1250.0 | T | 2200 |
| 1255 | Flip the Cards | 2-sat constructive algorithms data structures dsu greedy sortings | Statement | D | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1750.0 | T | 2600 |
| 3692 | Triangular Paths | constructive algorithms greedy math shortest paths sortings | Statement | F | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 391 | Tree Calendar | brute force constructive algorithms dfs and similar sortings | Statement | E | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 711 | Swap Pass | constructive algorithms geometry sortings | Statement | D | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 937 | Chips on a Board | bitmasks brute force data structures games sortings | Statement | G | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 1427 | Swapping Problem | brute force constructive algorithms data structures sortings | Statement | F | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 3500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 1675 | Cost Equilibrium | combinatorics constructive algorithms math sortings | Statement | E | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2750.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 6451 | GCD and MST | constructive algorithms data structures dsu graphs implementation number theory sortings | Statement | D | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2000.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 4803 | Cut and Stick | binary search data structures greedy probabilities sortings | Statement | D | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2000.0 | Codeforces round #716 editorial | |
| 695 | Baby Ehab's Hyper Apartment | binary search graphs interactive sortings | Statement | E | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2500.0 | Codeforces round #716 editorial | |
| 421 | Phoenix and Diamonds | binary search data structures sortings | Statement | I | Codeforces Global Round 14 {1515} | PROGRAMMING | 5000.0 | Editorial | |
| 12797 | Phoenix and Socks | greedy sortings two pointers | Statement | D | Codeforces Global Round 14 {1515} | PROGRAMMING | 2000.0 | Editorial | |
| 13821 | Morning Jogging | constructive algorithms greedy sortings | Statement | B | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1250.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 22285 | Berland Regional | brute force greedy sortings two pointers | Statement | C | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 893 | Off by One | constructive algorithms dfs and similar geometry graphs sortings trees | Statement | E | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 4809 | Robot Collisions | data structures greedy implementation sortings | Statement | C | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 24994 | Mean Inequality | constructive algorithms sortings | Statement | A | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 21203 | Sifid and Strange Subsequences | greedy sortings | Statement | B | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 1250.0 | Codeforces Round #722 Editorial | |
| 15546 | Pursuit | binary search greedy sortings | Statement | C | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1000.0 | Codeforces Round #733 Editorial (all problems) | |
| 589 | Teams Forming | *special sortings | Statement | D | Kotlin Heroes: Practice 7 {1532} | PROGRAMMING | |||
| 255 | Lost Nodes | dp graphs interactive sortings trees | Statement | H | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 34131 | Array Reodering | brute force greedy math number theory sortings | Statement | B | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 31252 | Stable Groups | greedy sortings | Statement | C | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1250.0 | tutorial | 1200 |
| 12703 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 982 | Strange Array | data structures greedy sortings | Statement | F | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2500.0 | tutorial | 2600 |
| 14957 | Great Graphs | constructive algorithms graphs greedy shortest paths sortings | Statement | A | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 500.0 | Tutorial | |
| 14857 | AquaMoon and Strange Sort | sortings | Statement | A | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 500.0 | Codeforces Round #732 Editorial | 1500 |
| 16335 | Air Conditioners | dfs and similar dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 14481 | Interesting Story | greedy sortings strings | Statement | C | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 3297 | Telepanting | binary search data structures dp sortings | Statement | F | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 669 | A Serious Referee | bitmasks brute force dfs and similar sortings | Statement | G | Codeforces Global Round 15 {1552} | PROGRAMMING | 2500.0 | Editorial of Global Round 15 | |
| 16891 | Running for Gold | combinatorics graphs greedy probabilities sortings | Statement | B | Codeforces Global Round 15 {1552} | PROGRAMMING | 500.0 | Editorial of Global Round 15 | |
| 2122 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 25300 | Subsequence Permutation | sortings strings | Statement | A | Codeforces Global Round 15 {1552} | PROGRAMMING | 250.0 | Editorial of Global Round 15 | |
| 4515 | Boring Segments | binary search data structures sortings two pointers | Statement | E | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2100 | |
| 24582 | Moamen and k-subarrays | greedy sortings | Statement | B | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 1000.0 | Codeforces Round #737 Editorial | |
| 511 | Strange Sort | data structures sortings | Statement | F | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 3500.0 | Codeforces Round #740 Editorial | 3300 |
| 8855 | Polycarp and String Transformation | binary search implementation sortings strings | Statement | E | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1800 | |
| 21213 | Deep Down Below | binary search greedy sortings | Statement | C | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1250.0 | Codeforces Round #740 Editorial | 1300 |
| 17152 | Simply Strange Sort | brute force implementation sortings | Statement | A | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 500.0 | Codeforces Round #740 Editorial | 800 |
| 8327 | Seating Arrangements (hard version) | data structures greedy implementation sortings two pointers | Statement | D2 | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 14705 | Seating Arrangements (easy version) | data structures greedy sortings | Statement | D1 | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 4598 | Inconvenient Pairs | data structures implementation sortings two pointers | Statement | D | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 18538 | Slay the Dragon | binary search greedy sortings | Statement | C | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 1696 | Longest Array Deconstruction | data structures divide and conquer dp sortings | Statement | L | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 5173 | Another Sorting Problem | data structures sortings strings | Statement | A | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 18870 | Shifting Sort | implementation sortings | Statement | B | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 397 | Omkar and Tours | sortings trees | Statement | H | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 3500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 17686 | Two Arrays | greedy math sortings | Statement | C | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 1000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 900 |
| 1410 | Yet Another Sorting Problem | data structures math sortings | Statement | D | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 2000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 17070 | Hemose Shopping | dsu math sortings | Statement | B | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1000.0 | 95583 | |
| 23741 | Gamer Hemose | greedy math sortings | Statement | A | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 500.0 | 95583 | |
| 2335 | Optimal Insertion | data structures divide and conquer greedy sortings | Statement | C | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2000.0 | 95865 | 2300 |
| 1912 | Difficult Mountain | data structures dp greedy sortings | Statement | D | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2700 |
| 19231 | Reverse Sort | greedy sortings | Statement | B | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 1000.0 | tutorial | 1000 |
| 1181 | Array Equalizer | binary search implementation math number theory sortings | Statement | E | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2500.0 | tutorial | 2400 |
| 1574 | Red-Blue Matrix | constructive algorithms data structures hashing implementation sortings two pointers | Statement | D | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 26784 | Minimum Extraction | brute force sortings | Statement | C | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 18108 | Blue-Red Permutation | greedy math sortings | Statement | D | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 1419 | Banquet Preparations 2 | greedy sortings | Statement | H | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 483 | The Cells on the Paper | binary search data structures implementation sortings | Statement | E | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 997 | Max Sum Array | combinatorics constructive algorithms greedy sortings | Statement | G | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 2805 | Messages | greedy math probabilities sortings | Statement | E | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 28800 | Divan and a New Project | constructive algorithms sortings | Statement | B | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 750.0 | Tutorial | 1000 |
| 16993 | Forbidden Subsequence | constructive algorithms sortings strings | Statement | A | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 750.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 1922 | Trader Problem | binary search data structures dsu greedy math sortings | Statement | G | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 8439 | New Year's Problem | binary search brute force greedy sortings | Statement | D | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 2724 | Unusual Minesweeper | binary search dfs and similar dsu implementation sortings | Statement | G | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 10188 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 1914 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 22296 | Berland Music | greedy sortings | Statement | B | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 14650 | Game on Ranges | brute force implementation sortings | Statement | B | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1000.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 19038 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 2315 | Binary Spiders | bitmasks data structures implementation sortings trees | Statement | D | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 2775 | Not Escaping | data structures dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2000.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 17537 | Not Sitting | games greedy sortings | Statement | B | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 97 | Spaceship Crisis Management | binary search data structures geometry sortings | Statement | F | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 3000.0 | 99276 | |
| 30886 | Download More RAM | greedy sortings | Statement | A | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #767 | |
| 3319 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 1736 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 2720 | Cars | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | E | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 567 | Minimize Inversions Number | data structures math sortings | Statement | H | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 24115 | Sorting Parts | sortings | Statement | A | Codeforces Global Round 19 {1637} | PROGRAMMING | 500.0 | Tutorial | |
| 22525 | Odd Swap Sort | data structures math sortings | Statement | B | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 750.0 | Codeforces Round #771 Editorial | |
| 2837 | Anonymity Is Important | binary search data structures dsu sortings | Statement | C | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 18964 | Great Sequence | brute force greedy sortings | Statement | A | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 500.0 | Codeforces Round #773 editorial | |
| 4060 | Repetitions Decoding | constructive algorithms implementation sortings | Statement | B | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 22654 | Quality vs Quantity | brute force constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1000.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 18633 | Weird Sum | combinatorics data structures geometry math matrices sortings | Statement | A | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 500.0 | Codeforces Round #775 Editorial | |
| 4457 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 18473 | Weight of the System of Nested Segments | greedy hashing implementation sortings | Statement | C | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 14493 | Alice and the Cake | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 1400 |
| 19378 | Maximum Cake Tastiness | greedy implementation sortings | Statement | A | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 800 |
| 20437 | Good Pairs | constructive algorithms math sortings | Statement | A | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 500.0 | Tutorial | |
| 20985 | Make Equal With Mod | math number theory sortings | Statement | C | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1500.0 | Tutorial | |
| 5282 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 1174 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 915 | Drone Photo | math sortings | Statement | N | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 |