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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1807 | 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 |
| 13526 | Eugene and an array | binary search data structures hashing implementation two pointers | Statement | C | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1250.0 | Codeforces Round #632 (Div. 2) editorial | |
| 1523 | Strange Function | data structures dp | Statement | F | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 11775 | Three Blocks Palindrome (easy version) | binary search brute force data structures dp two pointers | Statement | E1 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1700 | |
| 9426 | Three Blocks Palindrome (hard version) | brute force data structures dp two pointers | Statement | E2 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2000 | |
| 2423 | Robots on a Grid | data structures dfs and similar dsu graphs greedy matrices | Statement | F | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2600 | |
| 279 | Journey | data structures divide and conquer graphs trees | Statement | F | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 3250.0 | Codeforces Round #635 Editorial | 3600 |
| 13698 | Nastya and Strange Generator | brute force data structures greedy implementation | Statement | A | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 500.0 | Codeforces Round #637 Editorial | |
| 718 | Nastya and CBS | brute force data structures hashing | Statement | F | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 3000.0 | Codeforces Round #637 Editorial | |
| 6371 | 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 | |
| 13566 | Constant Palindrome Sum | brute force data structures greedy two pointers | Statement | D | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 1800 | |
| 1408 | Restore the Permutation by Sorted Segments | brute force constructive algorithms data structures greedy implementation | Statement | F | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 2800 | |
| 523 | Train Tracks | data structures trees | Statement | E | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 2500.0 | Codeforces Round #639 Editorial | 3100 |
| 253 | Dune II: Battle For Arrakis | *special data structures greedy math | Statement | F | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2000 | |
| 61 | Game with Segments | *special data structures games | Statement | H | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2700 | |
| 27619 | Phoenix and Beauty | constructive algorithms data structures greedy | Statement | B | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 1000.0 | Codeforces Round #638 (Div. 2) Editorial | 1400 |
| 917 | Phoenix and Memory | data structures dfs and similar graphs greedy | Statement | F | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 3000.0 | Codeforces Round #638 (Div. 2) Editorial | 2600 |
| 21889 | Orac and LCM | data structures math number theory | Statement | A | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 500.0 | Codeforces Round #641 Editorial | 1600 |
| 9318 | Skier | data structures implementation | Statement | C | Testing Round 16 (Unrated) {1351} | PROGRAMMING | 1500.0 | 1400 | |
| 20374 | Constructing the Array | constructive algorithms data structures sortings | Statement | D | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1600 | |
| 2454 | Are You Fired? | constructive algorithms data structures dp greedy implementation | Statement | E | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2000.0 | Codeforces Round #645 (Div. 2) Editorial | 2400 |
| 10780 | Yet Another Yet Another Task | data structures dp implementation two pointers | Statement | D | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2000 | |
| 584 | RC Kaboom Show | binary search brute force data structures geometry math | Statement | F | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2900 | |
| 172 | Johnny and New Toy | data structures implementation math | Statement | F | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 3500.0 | Codeforces Round #647 Editorial | 3300 |
| 31460 | XXXXX | brute force data structures number theory two pointers | Statement | A | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 750.0 | Codeforces round #649 editorial | 1200 |
| 4997 | Ehab's Last Corollary | constructive algorithms data structures dfs and similar dp graphs implementation trees | Statement | D | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 2000.0 | Codeforces round #649 editorial | 2100 |
| 25054 | Rotation Matching | constructive algorithms data structures greedy implementation | Statement | C | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #648 | 1400 |
| 678 | Shifting Dominoes | data structures geometry graphs trees | Statement | G | Codeforces Global Round 8 {1368} | PROGRAMMING | 3500.0 | Codeforces Global Round 8: editorial | |
| 2461 | 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 |
| 5230 | Binary Subsequence Rotation | binary search data structures dp greedy implementation | Statement | E | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2500.0 | Editorial — Codeforces Round #651 | |
| 693 | Raging Thunder | data structures implementation | Statement | F | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 3000.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 1885 | Network Coverage | binary search data structures flows graph matchings graphs greedy | Statement | F | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 17868 | Maximum Sum on Even Positions | data structures dp greedy | Statement | D | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 924 | Pawns | data structures greedy | Statement | G | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 1087 | Reading Books (hard version) | binary search data structures greedy sortings ternary search two pointers | Statement | E2 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 15018 | Reading Books (easy version) | data structures greedy implementation sortings | Statement | E1 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 498 | Set Merging | constructive algorithms data structures divide and conquer | Statement | H | Codeforces Global Round 9 {1375} | PROGRAMMING | 2750.0 | 79731 | |
| 6118 | 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 |
| 1152 | 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 |
| 582 | Chess Strikes Back (hard version) | data structures divide and conquer | Statement | F2 | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2800 |
| 894 | Strange Addition | data structures dp matrices | Statement | F | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 2423 | Merging Towers | data structures dsu implementation trees | Statement | E | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 21769 | Prefix Flip (Easy Version) | constructive algorithms data structures strings | Statement | A1 | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 1300 |
| 14385 | Prefix Flip (Hard Version) | constructive algorithms data structures strings two pointers | Statement | A2 | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 1700 |
| 1033 | Strange Operation | data structures dp | Statement | E | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 2000.0 | Codeforces Round #659 Editorial | |
| 2831 | Removing Leaves | data structures dfs and similar divide and conquer greedy implementation trees | Statement | F | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 660 | Joker | *special bitmasks data structures divide and conquer dsu | Statement | C | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 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 | ||
| 6919 | Captain Flint and Treasure | data structures dfs and similar dp graphs greedy implementation trees | Statement | D | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2000.0 | Codeforces Round #660 Editorial | 2000 |
| 648 | Uncle Bogdan and Projections | data structures geometry sortings | Statement | E | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2750.0 | Codeforces Round #660 Editorial | 2700 |
| 1249 | Bicolored Segments | data structures dp graph matchings greedy sortings | Statement | F | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 11062 | 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 | |
| 4195 | Rarity and New Dress | data structures dp graphs implementation | Statement | D | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1750.0 | Codeforces Round #662 Editorial | |
| 17385 | Applejack and Storages | data structures greedy implementation | Statement | B | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1000.0 | Codeforces Round #662 Editorial | |
| 1403 | Controversial Rounds | binary search data structures dp dsu two pointers | Statement | F | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 37218 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 2601 | 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 | ||
| 2534 | Weights Division (hard version) | binary search data structures dfs and similar greedy trees two pointers | Statement | E2 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 19954 | Binary String To Subsequences | constructive algorithms data structures greedy | Statement | D | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 6351 | Weights Division (easy version) | data structures dfs and similar greedy trees | Statement | E1 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 1165 | Mercenaries | bitmasks combinatorics data structures math two pointers | Statement | G | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11428 | Zigzags | brute force data structures dp math two pointers | Statement | D | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 1964 | Reverse and Swap | binary search bitmasks data structures divide and conquer | Statement | F | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 2648 | 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 | |
| 1358 | 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 | ||
| 313 | 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 | ||
| 395 | Spring cleaning | *special data structures dfs and similar graphs trees | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 3059 | Fixed Point Removal | binary search data structures greedy | Statement | C | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1500.0 | Codeforces Round #668 Editorial | |
| 3823 | Three Sequences | binary search data structures greedy math | Statement | D | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 5804 | Discrete Centrifugal Jumps | binary search data structures dp greedy | Statement | D | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2000.0 | Codeforces Round #669 Editorial | |
| 4690 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 6274 | 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 | |
| 6929 | Shurikens | data structures greedy implementation | Statement | D | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 16956 | k-Amazing Numbers | binary search data structures implementation two pointers | Statement | A | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 1500 |
| 5081 | XOR Inverse | bitmasks data structures divide and conquer greedy strings trees | Statement | C | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1250.0 | Codeforces Round #673 Editorial | 2000 |
| 2733 | Graph and Queries | data structures dfs and similar dsu graphs trees | Statement | D | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2000.0 | Codeforces Round #673 Editorial | 2600 |
| 434 | Split | data structures dp greedy | Statement | E | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2250.0 | Codeforces Round #673 Editorial | 3200 |
| 4751 | Trash Problem | data structures hashing implementation two pointers | Statement | D | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 2770 | Three Occurrences | data structures hashing two pointers | Statement | G | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 435 | Equal Product | data structures math number theory two pointers | Statement | F | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 8375 | Rescue Nibel! | combinatorics data structures sortings | Statement | D | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 2000.0 | Editorial | |
| 5200 | Pokémon Army (hard version) | data structures divide and conquer dp greedy implementation | Statement | C2 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1250.0 | ||
| 3207 | 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 | |
| 1290 | Boring Queries | data structures number theory trees | Statement | F | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2750.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 629 | Virus | data structures dsu graphs | Statement | H | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 17647 | Non-zero Segments | constructive algorithms data structures greedy | Statement | D | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1500 | |
| 402 | Boring Card Game | data structures greedy trees | Statement | F | Codeforces Global Round 11 {1427} | PROGRAMMING | 2250.0 | Editorial of Global Round 11 | 3200 |
| 2614 | Fruit Sequences | binary search data structures divide and conquer dp | Statement | F | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 4242 | Carrots for Rabbits | binary search data structures greedy math | Statement | E | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 28421 | Numbers on Whiteboard | constructive algorithms data structures games implementation math | Statement | C | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 7359 | String Reversal | data structures greedy strings | Statement | E | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 2714 | 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 | |
| 3963 | Make It Increasing | data structures dp implementation | Statement | E | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1278 | Death DBMS | data structures hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 2223 | Greedy Shopping | binary search data structures greedy | Statement | C | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1750.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 249 | Cheat and Win | bitmasks data structures games trees | Statement | E | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 2500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 1655 | Graph Subset Problem | brute force data structures graphs | Statement | B | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1250.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 5328 | Identify the Operations | brute force combinatorics data structures dsu greedy implementation | Statement | B | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1000.0 | 84298 | |
| 2938 | Sum | data structures divide and conquer dp greedy | Statement | D | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1750.0 | 84298 | |
| 4101 | Xor Tree | binary search bitmasks data structures divide and conquer dp trees | Statement | C | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1250.0 | E | |
| 377 | Line Distance | binary search data structures geometry | Statement | F | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 2112 | Frequency Problem (Easy Version) | data structures greedy | Statement | D1 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1750.0 | E | |
| 1733 | Frequency Problem (Hard Version) | data structures greedy | Statement | D2 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 750.0 | E | |
| 5818 | Rating Compression | data structures implementation two pointers | Statement | D | Codeforces Global Round 12 {1450} | PROGRAMMING | 1750.0 | Codeforces Global Round 12 Editorial | |
| 1710 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 21160 | Two Brackets | data structures greedy | Statement | C | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 4692 | Array Partition | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 6677 | Number of Simple Paths | combinatorics data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 558 | Nim Shortcuts | data structures games | Statement | E | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 2250.0 | Codeforces Round #691 Editorial (finished) | |
| 1707 | Latin Square | data structures implementation math matrices | Statement | C | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 1500.0 | Codeforces Round #691 Editorial (finished) | |
| 10320 | 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 | |
| 8608 | 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 | ||
| 444 | My Beautiful Madness | data structures trees | Statement | F | Codeforces Round 692 (Div. 1, based on Technocup 2021 Elimination Round 3) {1464} | PROGRAMMING | 3000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 247 | The Riddle of the Sphinx | binary search data structures data structures interactive | Statement | I | Good Bye 2020 {1466} | PROGRAMMING | 4000.0 | Good Bye 2020 Editorial | |
| 1775 | Distinctive Roots in a Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 2500.0 | Codeforces Round #695 (Div. 2) Editorial | 2500 |
| 1953 | LaIS | data structures dp greedy | Statement | A | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 243 | Bakery | data structures dsu | Statement | B | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 11383 | Berpizza | data structures implementation | Statement | C | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 1088 | Power Sockets | binary search data structures greedy | Statement | F | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 375 | Strange Permutation | binary search combinatorics data structures dp two pointers | Statement | E | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 2000.0 | 86464 | |
| 6791 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 8985 | Correct Placement | binary search data structures sortings two pointers | Statement | E | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 11002 | Program | data structures dp implementation | Statement | D | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 14222 | Array Destruction | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1500.0 | Codeforces Round #696 Editorial | |
| 4323 | Cleaning | data structures dp greedy implementation | Statement | D | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2000.0 | Codeforces Round #696 Editorial | |
| 2763 | Pattern Matching | bitmasks data structures dfs and similar graphs sortings strings | Statement | E | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 1164 | Lanterns | data structures dp | Statement | F | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 743 | Minimum Difference | data structures two pointers | Statement | G | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 181 | Nezzar and Tournaments | data structures greedy | Statement | E | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 2750.0 | 87294 | 3300 |
| 1348 | Odd Mineral Resource | bitmasks data structures hashing probabilities trees | Statement | D | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #700 | |
| 7481 | Painting the Array I | constructive algorithms data structures dp greedy implementation | Statement | B1 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 4443 | Painting the Array II | data structures dp greedy implementation | Statement | B2 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 2424 | Sorting Books | data structures dp greedy | Statement | E | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 3783 | Skyline Photo | data structures dp | Statement | E | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 4123 | Playlist | data structures dsu implementation | Statement | D | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2000.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 919 | Skyline Photo | data structures dp | Statement | C | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 1353 | Playlist | data structures dsu implementation two pointers | Statement | B | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1000.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 11086 | Floor and Mod | binary search brute force data structures math number theory | Statement | C | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1700 |
| 2341 | 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 |
| 9868 | Max Median | binary search data structures dp two pointers | Statement | D | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 1750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 812 | Pairs of Paths | combinatorics data structures trees | Statement | F | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 3000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 5147 | Cheap Dinner | data structures dp implementation sortings two pointers | Statement | E | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 232 | Palindromic Doubles | *special data structures dp | Statement | E | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 135 | Painting Numbers | *special data structures greedy number theory | Statement | G | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 21065 | Accidental Victory | binary search data structures greedy | Statement | E | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 18490 | 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 | ||
| 6205 | Old Floppy Drive | binary search data structures math | Statement | G | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 8411 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 17562 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 20953 | Card Deck | data structures greedy math | Statement | B | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1000.0 | Codeforces Round #704 Editorial | |
| 5778 | 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 | |
| 2067 | A-Z Graph | constructive algorithms data structures graphs | Statement | E | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 538 | Qingshan and Daniel | brute force data structures greedy implementation | Statement | E | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2500.0 | Codeforces Round #706 Editorial | |
| 423 | Squares | constructive algorithms data structures graphs trees | Statement | F | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 3250.0 | Codeforces Round #706 Editorial | |
| 9134 | Square-free division (easy version) | data structures dp greedy math number theory | Statement | E1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 1700 |
| 1920 | Square-free division (hard version) | data structures dp greedy hashing math number theory | Statement | E2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 2500 |
| 26193 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 23735 | Box Fitting | binary search bitmasks data structures greedy | Statement | B | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 12255 | Planar Reflections | brute force combinatorics data structures dp | Statement | C | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1750.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 1062 | Christmas Game | data structures dfs and similar dp games math trees | Statement | F | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 3000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 13462 | Minimum Grid Path | brute force data structures dp greedy | Statement | C | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 239 | Graph Coloring | data structures graphs interactive | Statement | G | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 3861 | 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 |
| 1267 | 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 |
| 232 | Balance the Cards | constructive algorithms data structures divide and conquer geometry graphs implementation | Statement | F | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 4000.0 | T | 3500 |
| 4843 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 14230 | Restoring the Permutation | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 1736 | Complete the MST | data structures dfs and similar dsu graphs greedy math | Statement | C | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 940 | Chips on a Board | bitmasks brute force data structures games sortings | Statement | G | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 33328 | Yet Another Card Deck | brute force data structures implementation trees | Statement | C | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 546 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 24607 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 1434 | 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 | |
| 6527 | 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 | |
| 4830 | 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 | |
| 431 | Phoenix and Diamonds | binary search data structures sortings | Statement | I | Codeforces Global Round 14 {1515} | PROGRAMMING | 5000.0 | Editorial | |
| 18814 | Phoenix and Towers | constructive algorithms data structures greedy | Statement | C | Codeforces Global Round 14 {1515} | PROGRAMMING | 1500.0 | Editorial | |
| 5226 | Cut | binary search data structures graphs number theory | Statement | D | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2000.0 | Codeforces round #717 editorial | |
| 3365 | Guess the K-th Zero (Hard version) | binary search data structures interactive | Statement | F2 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 65509 | Same Differences | data structures hashing math | Statement | D | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2315 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 9195 | Compression and Expansion | brute force data structures greedy implementation trees | Statement | C | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1500.0 | Deltix Round, Spring 2021. Editorial | 1600 |
| 525 | Try Booking | data structures divide and conquer | Statement | G | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 3250.0 | Deltix Round, Spring 2021. Editorial | 3200 |
| 445 | Hopping Around the Array | data structures dp | Statement | H | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 3250.0 | Deltix Round, Spring 2021. Editorial | 3500 |
| 4827 | Robot Collisions | data structures greedy implementation sortings | Statement | C | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 2806 | Kill Anton | brute force constructive algorithms data structures math strings | Statement | D | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2250.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 27392 | Potions (Easy Version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 750.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 30757 | Potions (Hard Version) | data structures greedy | Statement | C2 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 2292 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 2936 | Partition Game | binary search data structures divide and conquer dp | Statement | E | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 3000.0 | Tutorial | 2500 |
| 2980 | Trees of Tranquillity | data structures dfs and similar greedy trees | Statement | C | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1750.0 | Codeforces Round #722 Editorial | |
| 204 | Turing's Award | data structures dp | Statement | H | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 4750.0 | Codeforces Round #733 Editorial (all problems) | |
| 285 | Chess Team Forming | *special binary search data structures greedy | Statement | E | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 92 | Submatrices | *special bitmasks data structures dp | Statement | H | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 484 | Sweets | *special data structures implementation | Statement | C | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 3078 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 608 | String Distance | binary search data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 8524 | Playoff Tournament | data structures implementation trees | Statement | D | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 5079 | Omkar and Medians | data structures greedy implementation | Statement | D | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 2000.0 | Codeforces Round #724 — Editorial | 2000 |
| 6215 | Erase and Extend (Hard Version) | binary search data structures greedy hashing string suffix structures strings | Statement | E2 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 34719 | Number of Pairs | binary search data structures math two pointers | Statement | C | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 3228 | Funny Substrings | brute force data structures hashing implementation strings | Statement | E | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 12777 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1056 | Game with Cards | binary search constructive algorithms data structures dp implementation | Statement | E | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2000.0 | tutorial | 2500 |
| 986 | Strange Array | data structures greedy sortings | Statement | F | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2500.0 | tutorial | 2600 |
| 130 | AquaMoon and Potatoes | brute force data structures dp | Statement | F | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 4000.0 | Codeforces Round #732 Editorial | 3500 |
| 100 | AquaMoon and Time Stop (easy version) | data structures data structures dp dp | Statement | E1 | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 2000.0 | Codeforces Round #732 Editorial | 3500 |
| 101 | AquaMoon and Time Stop (hard version) | data structures dp | Statement | E2 | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 2000.0 | Codeforces Round #732 Editorial | 3500 |
| 7018 | Array Stabilization (GCD version) | binary search constructive algorithms data structures number theory two pointers | Statement | F | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 11411 | Integers Have Friends | binary search data structures math number theory two pointers | Statement | B | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1000.0 | Codeforces Round 736 Editorial | |
| 602 | Gregor and the Two Painters | data structures graphs math | Statement | E | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 3500.0 | Codeforces Round 736 Editorial | |
| 1850 | Stringforces | binary search bitmasks data structures dp greedy strings two pointers | Statement | E | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 902 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 16710 | Wonderful Coloring - 2 | binary search constructive algorithms data structures greedy | Statement | B2 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 3349 | Telepanting | binary search data structures dp sortings | Statement | F | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 2131 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 2534 | Pairwise Modulo | data structures math | Statement | F | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 2500.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 4558 | Boring Segments | binary search data structures sortings two pointers | Statement | E | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2100 | |
| 1059 | Good Graph | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2700 | |
| 13295 | Take Your Places! | data structures implementation | Statement | B | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 1000.0 | 94384 | 1300 |
| 3004 | Equilibrium | data structures greedy | Statement | E | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2000.0 | 94384 | 2200 |
| 3016 | Ezzat and Grid | data structures dp graphs greedy | Statement | D | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 2500.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 |
| 6132 | Up the Strip (simplified version) | brute force data structures dp math number theory | Statement | D1 | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1500.0 | Codeforces Round #740 Editorial | 1700 |
| 2251 | Two Hundred Twenty One (hard version) | binary search constructive algorithms data structures dp math | Statement | D2 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 385 | Four Vertices | constructive algorithms data structures graphs greedy implementation shortest paths | Statement | G | Codeforces Global Round 16 {1566} | PROGRAMMING | 3000.0 | Codeforces Global Round 16 Editorial | |
| 1179 | Points Movement | data structures dp | Statement | F | Codeforces Global Round 16 {1566} | PROGRAMMING | 2500.0 | Codeforces Global Round 16 Editorial | |
| 8347 | 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 | |
| 14733 | Seating Arrangements (easy version) | data structures greedy sortings | Statement | D1 | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 4155 | Non-Decreasing Dilemma | data structures implementation | Statement | E | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 2250.0 | Codeforces Round #742 Editorial | |
| 4609 | Inconvenient Pairs | data structures implementation sortings two pointers | Statement | D | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 20 | Chainword | *special data structures strings | Statement | H | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING | |||
| 85 | A Battle Against a Dragon | *special data structures dp | Statement | G | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 10481 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 4864 | The Strongest Build | data structures dfs and similar graphs greedy hashing implementation shortest paths | Statement | D | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 1720 | 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 | ||
| 5216 | Another Sorting Problem | data structures sortings strings | Statement | A | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 1022 | Illusions of the Desert | data structures trees | Statement | I | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 346 | Just Kingdom | data structures dfs and similar | Statement | J | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 476 | Building Forest Trails | data structures dsu | Statement | B | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 7423 | Array Optimization by Deque | data structures greedy | Statement | E2 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 2252 | Train Maintenance | brute force data structures implementation | Statement | C | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1750.0 | Codeforces Round #745 Editorial | 2200 |
| 124 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 4235 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 24135 | Grandma Capa Knits a Scarf | data structures greedy strings two pointers | Statement | C | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 704 | Kuzya and Homework | data structures number theory | Statement | G | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 3250.0 | Codeforces Round #750 (Div.2) Editorial | |
| 7448 | Omkar and Determination | data structures dp | Statement | C | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 499 | Omkar and Time Travel | data structures math | Statement | G | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 3000.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 1475 | Game with Stones | binary search data structures games greedy | Statement | E | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2000.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2300 |
| 1212 | Frequency Queries | data structures dfs and similar trees | Statement | E | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 2500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial |