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 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1388 | Death DBMS | data structures hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 2317 | 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 | |
| 316 | 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 | |
| 1697 | 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 | |
| 5470 | 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 | |
| 3153 | 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 | |
| 4194 | 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 | |
| 487 | Line Distance | binary search data structures geometry | Statement | F | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 3000.0 | E | |
| 2200 | Frequency Problem (Easy Version) | data structures greedy | Statement | D1 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1750.0 | E | |
| 2029 | Frequency Problem (Hard Version) | data structures greedy | Statement | D2 | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 750.0 | E | |
| 5881 | Rating Compression | data structures implementation two pointers | Statement | D | Codeforces Global Round 12 {1450} | PROGRAMMING | 1750.0 | Codeforces Global Round 12 Editorial | |
| 1765 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 21382 | Two Brackets | data structures greedy | Statement | C | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 4988 | 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 | ||
| 7014 | 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 | ||
| 534 | Forbidden Value | data structures | Statement | G | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 691 | Nim Shortcuts | data structures games | Statement | E | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 2250.0 | Codeforces Round #691 Editorial (finished) | |
| 1800 | Latin Square | data structures implementation math matrices | Statement | C | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 1500.0 | Codeforces Round #691 Editorial (finished) | |
| 10437 | 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 | |
| 8874 | 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 | ||
| 447 | 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 | |
| 251 | 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 | |
| 1856 | 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 |
| 1176 | Similar Sets | data structures | Statement | M | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) — Tutorials | ||
| 2016 | 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) | ||
| 263 | Bakery | data structures dsu | Statement | B | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 11542 | Berpizza | data structures implementation | Statement | C | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 1137 | Power Sockets | binary search data structures greedy | Statement | F | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 996 | Strange Permutation | binary search combinatorics data structures dp two pointers | Statement | E | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 2000.0 | 86464 | |
| 6842 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 9139 | Correct Placement | binary search data structures sortings two pointers | Statement | E | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 11182 | Program | data structures dp implementation | Statement | D | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 14438 | Array Destruction | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1500.0 | Codeforces Round #696 Editorial | |
| 4364 | Cleaning | data structures dp greedy implementation | Statement | D | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2000.0 | Codeforces Round #696 Editorial | |
| 2854 | Pattern Matching | bitmasks data structures dfs and similar graphs sortings strings | Statement | E | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 1227 | Lanterns | data structures dp | Statement | F | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 1043 | Minimum Difference | data structures two pointers | Statement | G | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 3710 | Nezzar and Binary String | data structures | Statement | B | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 1000.0 | 87294 | 1900 |
| 306 | Nezzar and Tournaments | data structures greedy | Statement | E | Codeforces Round 698 (Div. 1) {1477} | PROGRAMMING | 2750.0 | 87294 | 3300 |
| 1442 | 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 | |
| 7551 | 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 | |
| 4571 | 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 | |
| 2504 | Sorting Books | data structures dp greedy | Statement | E | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 3967 | Skyline Photo | data structures dp | Statement | E | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 4146 | 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 | |
| 11237 | 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 |
| 2408 | 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 |
| 10430 | 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 | |
| 884 | Pairs of Paths | combinatorics data structures trees | Statement | F | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 3000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 5200 | Cheap Dinner | data structures dp implementation sortings two pointers | Statement | E | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 74 | Build From Suffixes | *special combinatorics data structures | Statement | H | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 238 | Palindromic Doubles | *special data structures dp | Statement | E | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 137 | Painting Numbers | *special data structures greedy number theory | Statement | G | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 194 | Dogecoin | *special *special binary search data structures | Statement | F | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 21397 | Accidental Victory | binary search data structures greedy | Statement | E | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 18751 | 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 | ||
| 6289 | Old Floppy Drive | binary search data structures math | Statement | G | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 8466 | 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 | |
| 1297 | Yuezheng Ling and Dynamic Tree | data structures | Statement | H | Codeforces Global Round 13 {1491} | PROGRAMMING | 3000.0 | Codeforces Global Round 13 Editorial | |
| 17716 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 21100 | Card Deck | data structures greedy math | Statement | B | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1000.0 | Codeforces Round #704 Editorial | |
| 5928 | 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 | |
| 2107 | 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 | ||
| 548 | Qingshan and Daniel | brute force data structures greedy implementation | Statement | E | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2500.0 | Codeforces Round #706 Editorial | |
| 556 | Squares | constructive algorithms data structures graphs trees | Statement | F | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 3250.0 | Codeforces Round #706 Editorial | |
| 9210 | 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 |
| 1968 | 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 |
| 26486 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 25069 | 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 | |
| 12683 | 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 | |
| 1117 | 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 | |
| 13534 | 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 | ||
| 404 | Graph Coloring | data structures graphs interactive | Statement | G | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 432 | Subset Trick | binary search data structures | Statement | E | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 2500.0 | Codeforces Round #707 Editorial | 3300 |
| 3932 | 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 |
| 1323 | 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 |
| 240 | 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 |
| 4929 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 14392 | Restoring the Permutation | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 183 | Optimal Encoding | brute force data structures | Statement | F | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 4000.0 | Codeforces Round #715 Editorial | |
| 1820 | 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 | |
| 990 | Chips on a Board | bitmasks brute force data structures games sortings | Statement | G | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 35012 | Yet Another Card Deck | brute force data structures implementation trees | Statement | C | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 608 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 25011 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 1493 | 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 | |
| 6843 | 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 | |
| 5102 | 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 | |
| 448 | Phoenix and Diamonds | binary search data structures sortings | Statement | I | Codeforces Global Round 14 {1515} | PROGRAMMING | 5000.0 | Editorial | |
| 371 | Phoenix and Bits | bitmasks data structures | Statement | H | Codeforces Global Round 14 {1515} | PROGRAMMING | 4250.0 | Editorial | |
| 19091 | Phoenix and Towers | constructive algorithms data structures greedy | Statement | C | Codeforces Global Round 14 {1515} | PROGRAMMING | 1500.0 | Editorial | |
| 5383 | Cut | binary search data structures graphs number theory | Statement | D | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2000.0 | Codeforces round #717 editorial | |
| 3439 | Guess the K-th Zero (Hard version) | binary search data structures interactive | Statement | F2 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 69415 | Same Differences | data structures hashing math | Statement | D | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2412 | 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 | |
| 9225 | 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 |
| 599 | 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 |
| 465 | 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 |
| 5094 | Robot Collisions | data structures greedy implementation sortings | Statement | C | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 2865 | 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 | |
| 28235 | 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 | |
| 32278 | Potions (Hard Version) | data structures greedy | Statement | C2 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 2352 | 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 |
| 3103 | Partition Game | binary search data structures divide and conquer dp | Statement | E | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 3000.0 | Tutorial | 2500 |
| 3051 | 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 | |
| 210 | 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 | ||
| 3165 | Gold Transfer | binary search data structures greedy interactive trees | Statement | E | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 730 | String Distance | binary search data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 8595 | Playoff Tournament | data structures implementation trees | Statement | D | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 5188 | Omkar and Medians | data structures greedy implementation | Statement | D | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 2000.0 | Codeforces Round #724 — Editorial | 2000 |
| 6415 | 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 | |
| 36134 | 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 | ||
| 3290 | Funny Substrings | brute force data structures hashing implementation strings | Statement | E | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 12910 | PriceFixed | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 1500.0 | tutorial | 1600 |
| 1117 | Game with Cards | binary search constructive algorithms data structures dp implementation | Statement | E | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2000.0 | tutorial | 2500 |
| 1092 | Strange Array | data structures greedy sortings | Statement | F | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2500.0 | tutorial | 2600 |
| 412 | Inverse Inversions | binary search brute force data structures | Statement | D | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 3000.0 | Tutorial | |
| 149 | AquaMoon and Potatoes | brute force data structures dp | Statement | F | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 4000.0 | Codeforces Round #732 Editorial | 3500 |
| 107 | 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 |
| 107 | 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 |
| 7316 | 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 | ||
| 11712 | 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 | |
| 620 | Gregor and the Two Painters | data structures graphs math | Statement | E | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 3500.0 | Codeforces Round 736 Editorial | |
| 1971 | 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 | ||
| 973 | 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 | ||
| 16849 | 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) | ||
| 3412 | Telepanting | binary search data structures dp sortings | Statement | F | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 2155 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 2621 | 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 | |
| 4772 | Boring Segments | binary search data structures sortings two pointers | Statement | E | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2100 | |
| 1150 | Good Graph | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2700 | |
| 13367 | 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 |
| 3108 | Equilibrium | data structures greedy | Statement | E | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2000.0 | 94384 | 2200 |
| 3165 | Ezzat and Grid | data structures dp graphs greedy | Statement | D | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 2500.0 | Codeforces Round #737 Editorial | |
| 1180 | Top-Notch Insertions | combinatorics data structures | Statement | D | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 2000.0 | Codeforces Round #740 Editorial | 2600 |
| 615 | 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 |
| 6200 | 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 |
| 2293 | 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) | |
| 444 | 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 | |
| 1287 | Points Movement | data structures dp | Statement | F | Codeforces Global Round 16 {1566} | PROGRAMMING | 2500.0 | Codeforces Global Round 16 Editorial | |
| 8380 | 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 | |
| 14792 | Seating Arrangements (easy version) | data structures greedy sortings | Statement | D1 | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 4403 | Non-Decreasing Dilemma | data structures implementation | Statement | E | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 2250.0 | Codeforces Round #742 Editorial | |
| 4648 | 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 | |||
| 67 | Physical Examination | *special binary search data structures | Statement | I | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 89 | A Battle Against a Dragon | *special data structures dp | Statement | G | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 10734 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 600 | Stations | data structures | Statement | F | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 3250.0 | Tutorial | 3400 |
| 4929 | 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 | ||
| 325 | Cyclic Sum | data structures | Statement | C | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 1773 | 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 | ||
| 5301 | Another Sorting Problem | data structures sortings strings | Statement | A | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 1067 | Illusions of the Desert | data structures trees | Statement | I | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 390 | 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) | ||
| 508 | Building Forest Trails | data structures dsu | Statement | B | ICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1578} | PROGRAMMING | Tutorial (PDF) | ||
| 7543 | Array Optimization by Deque | data structures greedy | Statement | E2 | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 2352 | Train Maintenance | brute force data structures implementation | Statement | C | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1750.0 | Codeforces Round #745 Editorial | 2200 |
| 126 | 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 |
| 4319 | 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 | |
| 25722 | 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 | |
| 746 | Kuzya and Homework | data structures number theory | Statement | G | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 3250.0 | Codeforces Round #750 (Div.2) Editorial | |
| 7519 | 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) | |
| 571 | 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) | |
| 1508 | 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 |
| 1259 | 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 | |
| 359 | Jumping Through the Array | data structures graphs two pointers | Statement | F | Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) {1588} | PROGRAMMING | 3750.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 3500 |
| 336 | Non-equal Neighbours | combinatorics data structures dp math | Statement | F | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 3000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 293 | Frequency Queries | data structures dfs and similar | Statement | E | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 2500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 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 | |
| 1940 | Changing Brackets | data structures greedy | Statement | G | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 1691 | RBS | binary search bitmasks data structures dp | Statement | F | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 2584 | Staircases | brute force combinatorics data structures dfs and similar dp | Statement | E | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 24103 | Delete Two Elements | data structures math | Statement | C | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 150 | Desert | data structures graphs | Statement | I | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | Tutorial | ||
| 98 | Two Arrays | data structures matrices | Statement | E | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 5587 | Frog Traveler | data structures dp graphs shortest paths | Statement | B | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 1250.0 | 95865 | 1900 |
| 2400 | Optimal Insertion | data structures divide and conquer greedy sortings | Statement | C | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2000.0 | 95865 | 2300 |
| 2069 | Difficult Mountain | data structures dp greedy sortings | Statement | D | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2700 |
| 652 | Phys Ed Online | data structures dp greedy trees | Statement | E | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2900 |
| 821 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 1635 | 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 | ||
| 313 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 532 | 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) | |
| 7457 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 2541 | William The Oblivious | data structures divide and conquer dp matrices | Statement | E | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2750.0 | Deltix Round, Autumn 2021. Editorial | 2400 |
| 1084 | Interesting Sections | binary search data structures divide and conquer geometry meet-in-the-middle | Statement | F | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3000.0 | Deltix Round, Autumn 2021. Editorial | 2800 |
| 676 | A Stroll Around the Matrix | data structures greedy math | Statement | G | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3250.0 | Deltix Round, Autumn 2021. Editorial | 3000 |
| 783 | Squid Game | data structures dfs and similar divide and conquer greedy trees | Statement | H | Codeforces Global Round 17 {1610} | PROGRAMMING | 3500.0 | Codeforces Global Round 17 Editorial | |
| 671 | AmShZ Wins a Bet | data structures hashing | Statement | G | Codeforces Global Round 17 {1610} | PROGRAMMING | 3250.0 | Codeforces Global Round 17 Editorial | |
| 7634 | ATM and Students | binary search data structures two pointers | Statement | F | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1700 | |
| 795 | Robot and Candies | data structures greedy | Statement | G | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2500 | |
| 998 | Divan and a Cottage | binary search data structures | Statement | E | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 2750.0 | Tutorial | 2600 |
| 2764 | Lexicographically Small Enough | data structures greedy strings | Statement | E | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2500.0 | Good Bye 2021 -- Editorial | 2200 |
| 2005 | 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 | ||
| 1527 | Permutation and Queries | brute force data structures | Statement | H | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 10385 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 10073 | Replace the Numbers | data structures dsu greedy trees | Statement | E | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1960 | New School | binary search data structures greedy implementation sortings | Statement | E | Hello 2022 {1621} | PROGRAMMING | 2250.0 | ||
| 917 | Weighted Increasing Subsequences | data structures dp | Statement | G | Hello 2022 {1621} | PROGRAMMING | 3000.0 | ||
| 14672 | Integers Shop | data structures greedy implementation | Statement | B | Hello 2022 {1621} | PROGRAMMING | 1000.0 | ||
| 150 | Two Sequences | data structures hashing string suffix structures | Statement | I | Hello 2022 {1621} | PROGRAMMING | 4500.0 | ||
| 1303 | Middle Duplication | data structures dfs and similar greedy strings trees | Statement | E | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 2381 | 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) | |
| 1205 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 742 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 13878 | Road Optimization | data structures dp | Statement | C | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 12030 | Monsters And Spells | data structures dp fft greedy implementation two pointers | Statement | C | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 2891 | 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 | |
| 123 | Spaceship Crisis Management | binary search data structures geometry sortings | Statement | F | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 3000.0 | 99276 | |
| 1409 | Groceries in Meteor Town | data structures trees | Statement | E | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 2250.0 | 99276 | |
| 6551 | Range and Partition | binary search data structures greedy two pointers | Statement | B | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 3387 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 5469 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 1822 | 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 | ||
| 759 | Perfect Matching | data structures interactive trees | Statement | F | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 2321 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 1518 | Closest Pair | data structures greedy | Statement | F | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 3000.0 | Codeforces Round #772 Editorial | |
| 641 | Minimize Inversions Number | data structures math sortings | Statement | H | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 2492 | Colorful Operations | data structures implementation | Statement | E | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 2500.0 | Codeforces Round #771 Editorial | |
| 22789 | Odd Swap Sort | data structures math sortings | Statement | B | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 750.0 | Codeforces Round #771 Editorial | |
| 281 | Two Posters | data structures two pointers | Statement | F | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 3250.0 | Codeforces Round #771 Editorial | |
| 2901 | Anonymity Is Important | binary search data structures dsu sortings | Statement | C | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 7428 | Integral Array | brute force constructive algorithms data structures math | Statement | B | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 20180 | 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 | |
| 3389 | Tyler and Strings | combinatorics data structures implementation strings | Statement | C | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1500.0 | Codeforces Round #775 Editorial | |
| 623 | Air Reform | data structures dfs and similar divide and conquer dsu graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 191 | Two Avenues | data structures dfs and similar graphs | Statement | F | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 3750.0 | Codeforces Round #775 Editorial | |
| 1082 | Serious Business | data structures divide and conquer dp shortest paths | Statement | D | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2000.0 | Codeforces Round #775 Editorial | |
| 4503 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 531 | Tower Defense | binary search brute force data structures | Statement | F | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 6830 | Nearest Excluded Points | binary search data structures dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 11682 | Fault-tolerant Network | brute force data structures implementation | Statement | C | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 14664 | 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 |
| 1532 | Minimal String Xoration | bitmasks data structures divide and conquer hashing strings | Statement | F | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2800 |
| 475 | Snowy Mountain | data structures graphs greedy shortest paths trees | Statement | G | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2900 |
| 28890 | Subtract Operation | constructive algorithms data structures math two pointers | Statement | B | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1000.0 | Tutorial | |
| 3230 | 388535 (Hard Version) | bitmasks brute force data structures math | Statement | D2 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 10112 | 388535 (Easy Version) | bitmasks data structures math | Statement | D1 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1250.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 1260 | 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 | |
| 2035 | AND-MEX Walk | bitmasks brute force data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 4504 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 3233 | Promising String (hard version) | data structures implementation math strings | Statement | F2 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 1177 | Narrow Components | data structures dfs and similar dsu trees | Statement | E | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 5530 | Progressions Covering | data structures greedy implementation | Statement | D | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial |