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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2489 | 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 |
| 29668 | New Theatre Square | brute force dp greedy implementation two pointers | Statement | B | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 7652 | Tree Shuffling | dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |
| 4702 | Two Arrays | binary search brute force combinatorics dp greedy implementation two pointers | Statement | E | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 5968 | Necklace Assembly | binary search brute force dp greedy number theory | Statement | E | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 2032 | Flying Sort (Hard Version) | binary search dp greedy two pointers | Statement | F2 | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 3734 | Flying Sort (Easy Version) | dp greedy two pointers | Statement | F1 | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 9330 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 5313 | 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 | |
| 11378 | Odd-Even Subsequence | binary search dp greedy implementation sortings | Statement | D | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 5954 | Omkar and Circle | brute force constructive algorithms dp games greedy | Statement | D | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2000.0 | Codeforces Round #655 Editorial | 2100 |
| 19582 | Pluses and Minuses | binary search dp greedy implementation math | Statement | C | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 3000 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 18206 | 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 | ||
| 23110 | Create The Teams | dp greedy sortings | Statement | C | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 840 | The Majestic Brown Tree Snake | dfs and similar dp greedy trees two pointers | Statement | D | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2500.0 | Codeforces Round #658 Editorial | 3000 |
| 5809 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 4144 | Koa and the Beach (Easy Version) | dp greedy | Statement | B1 | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 500.0 | Codeforces Round #659 Editorial | |
| 10536 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 7009 | 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 |
| 20893 | Good String | brute force dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 1320 | Bicolored Segments | data structures dp graph matchings greedy sortings | Statement | F | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 570 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 21386 | Array Walk | dp greedy math | Statement | B | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 10069 | Omkar and Bed Wars | constructive algorithms dp greedy math strings | Statement | D | Codeforces Global Round 10 {1392} | PROGRAMMING | 1500.0 | Codeforces Global Round 10 — Editorial | |
| 7178 | Boboniu Chats with Du | brute force dp greedy sortings two pointers | Statement | A | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1800 |
| 1321 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 2871 | Monster Invaders | dp greedy | Statement | C | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1750.0 | Codeforces Round #666 — Editorial | |
| 12846 | Colored Rectangles | dp graph matchings greedy sortings | Statement | D | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1307 | x-prime Substrings | bitmasks dp greedy number theory string suffix structures strings | Statement | F | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 6640 | Clear the Multiset | divide and conquer dp greedy sortings | Statement | E | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 24903 | Maximum Product | brute force dp greedy implementation sortings | Statement | B | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 6041 | Discrete Centrifugal Jumps | binary search data structures dp greedy | Statement | D | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2000.0 | Codeforces Round #669 Editorial | |
| 2019 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 5278 | Subsequences of Length Two | dp greedy | Statement | F | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 555 | Split | data structures dp greedy | Statement | E | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2250.0 | Codeforces Round #673 Editorial | 3200 |
| 30686 | Mortal Kombat Tower | dp greedy | Statement | C | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 19343 | Pokémon Army (easy version) | constructive algorithms dp greedy | Statement | C1 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 5311 | Pokémon Army (hard version) | data structures divide and conquer dp greedy implementation | Statement | C2 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1250.0 | ||
| 925 | Minlexes | dp greedy implementation strings | Statement | E | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 714 | Lucky Numbers (Easy Version) | dp greedy | Statement | G1 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 2250.0 | Codeforces Raif Round 1 Editorial | |
| 856 | Lucky Numbers (Hard Version) | dp greedy | Statement | G2 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 750.0 | Codeforces Raif Round 1 Editorial | |
| 1091 | Realistic Gameplay | dp greedy | Statement | F | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 217 | Number Deletion Game | *special dp games greedy | Statement | G | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 12688 | Chef Monocarp | dp flows graph matchings greedy | Statement | C | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 3179 | 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 | |
| 9899 | Extreme Subtraction | dp greedy | Statement | A | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 500.0 | 84298 | |
| 17535 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 2267 | Dog Snacks | binary search dfs and similar dp greedy trees | Statement | E | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 527 | String and Operations | dp greedy | Statement | F | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 13361 | Sequence and Swaps | dp greedy sortings | Statement | D | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 687 | Mathematical Expression | constructive algorithms dp greedy | Statement | F | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2750.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 37303 | Unique Number | dp greedy math | Statement | C | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 721 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 18957 | Canine poetry | dp greedy strings | Statement | C | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 2028 | 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) | ||
| 11795 | Building a Fence | dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 31455 | Strange Birthday Party | dp greedy sortings two pointers | Statement | A | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 500.0 | 86464 | |
| 3362 | New Year's Puzzle | brute force dp graph matchings greedy sortings | Statement | F | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 31482 | Even-Odd Game | dp games greedy sortings | Statement | D | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 61582 | Fair Division | dp greedy | Statement | B | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 4372 | Cleaning | data structures dp greedy implementation | Statement | D | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2000.0 | Codeforces Round #696 Editorial | |
| 11407 | Cleaning the Phone | binary search dp greedy sortings two pointers | Statement | D | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 12447 | Longest Simple Cycle | constructive algorithms dp graphs greedy | Statement | C | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 7563 | 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 | |
| 4592 | 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 | |
| 2516 | Sorting Books | data structures dp greedy | Statement | E | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 915 | AB Tree | dp greedy trees | Statement | F | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 3000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 1596 | Move and Swap | dp greedy trees | Statement | E | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #701 (Div. 2) | 2500 |
| 540 | Ones | dp greedy | Statement | F | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 8482 | 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 | |
| 17757 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 9235 | 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 |
| 1979 | 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 |
| 2547 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 13589 | 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 | ||
| 22254 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 3943 | 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 |
| 4951 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 16258 | The Sports Festival | dp greedy | Statement | C | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 27308 | AGAGA XOOORRR | bitmasks brute force dp greedy | Statement | B | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1000.0 | Codeforces round #717 editorial | |
| 30664 | Arranging The Sheep | dp greedy math | Statement | E | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2417 | 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 | |
| 513 | Goblins And Gnomes | brute force dp graph matchings | Statement | F | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 11159 | Armchairs | brute force dp greedy | Statement | D | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 28447 | 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 | |
| 20284 | Parsa's Humongous Tree | brute force dfs and similar dp greedy trees | Statement | A | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 750.0 | Codeforces Round #722 Editorial | |
| 844 | Falling Sand (Hard Version) | dfs and similar dp graphs greedy | Statement | F2 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 18092 | Unstable String | dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 17196 | Erase and Extend (Easy Version) | binary search brute force dp greedy hashing string suffix structures strings | Statement | E1 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1250.0 | Codeforces Round #726 (Div.2) Editorial | |
| 24785 | Pair Programming | dp greedy two pointers | Statement | C | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 1974 | 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 | ||
| 20151 | Penalty | brute force dp greedy | Statement | C | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 3174 | Ezzat and Grid | data structures dp graphs greedy | Statement | D | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 2500.0 | Codeforces Round #737 Editorial | |
| 24513 | Mocha and Red and Blue | dp greedy | Statement | B | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 750.0 | Tutorial (en) | 900 |
| 5138 | Nearest Beautiful Number (hard version) | bitmasks brute force constructive algorithms dfs and similar dp greedy | Statement | F2 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 2100 | |
| 19286 | MAX-MEX Cut | bitmasks constructive algorithms dp greedy | Statement | C | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 377 | Fix the String | *special bitmasks dp greedy | Statement | E | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 1793 | Paint | dp greedy | Statement | C | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 1750.0 | Tutorial | 2700 |
| 2836 | Minimal Coverage | binary search dp greedy | Statement | G | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 11798 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 3956 | Portal | brute force dp greedy implementation | Statement | A | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 1700 |
| 4342 | 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 | |
| 1200 | Strange LCS | bitmasks dp graphs greedy strings | Statement | F | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2600 |
| 44566 | Make it Divisible by 25 | dp greedy math math | Statement | B | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 2098 | Difficult Mountain | data structures dp greedy sortings | Statement | D | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2700 |
| 654 | Phys Ed Online | data structures dp greedy trees | Statement | E | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2900 |
| 2359 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 7472 | 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) | |
| 4460 | Escape The Maze (hard version) | dfs and similar dp greedy shortest paths trees two pointers | Statement | E2 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2000 | |
| 760 | Armor and Weapons | brute force dp greedy shortest paths | Statement | F | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 1776 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 5738 | Keep the Average High | dp greedy math | Statement | D | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2000.0 | Good Bye 2021 -- Editorial | 2000 |
| 21208 | Array and Operations | dp greedy math | Statement | D | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 10420 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7369 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 12060 | Monsters And Spells | data structures dp fft greedy implementation two pointers | Statement | C | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 1971 | Black and White Tree | dp greedy trees | Statement | E | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 3414 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 2118 | Flipping Range | dp greedy number theory | Statement | D | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #768 | |
| 28840 | Fun with Even Subarrays | dp greedy | Statement | B | Codeforces Round 768 (Div. 2) {1631} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #768 | |
| 5491 | 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 | |
| 20045 | Make Them Equal | dp greedy shortest paths | Statement | D | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 15528 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 2209 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 557 | Madoka and Laziness | dp greedy | Statement | F | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 3000.0 | Codeforces Round #777 Editorial | |
| 1770 | Vitaly and Advanced Useless Algorithms | dp greedy | Statement | F | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 16356 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 22424 | Get an Even String | dp greedy strings | Statement | C | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 1874 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 6462 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 48036 | Make It Increasing | dp greedy | Statement | B | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 19534 | Detective Task | dp greedy | Statement | C | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 4461 | Moving Chips | binary search bitmasks dp greedy | Statement | E | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 1017 | Labyrinth Adventures | data structures dp greedy matrices shortest paths | Statement | E | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2600 | |
| 19513 | Odd Subarrays | dp greedy | Statement | B | Codeforces Round 794 (Div. 2) {1686} | PROGRAMMING | 1000.0 | 103198 | |
| 14145 | Infected Tree | constructive algorithms dfs and similar dp greedy trees | Statement | C | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 9791 | Fake Plastic Trees | dfs and similar dp greedy trees | Statement | B | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1700 |
| 1183 | Decinc Dividing | brute force data structures divide and conquer dp greedy | Statement | D | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2250.0 | Codeforces Round #800 Editorial | 2800 |
| 14803 | Zero Path | brute force data structures dp greedy shortest paths | Statement | C | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2522 | Tree Queries (Easy Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D1 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2355 | Tree Queries (Hard Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D2 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 221 | Maximum Product? | brute force combinatorics dp greedy math two pointers | Statement | H | Codeforces Global Round 21 {1696} | PROGRAMMING | 4000.0 | Editorial of Codeforces Global Round 21 | |
| 16011 | awoo's Favorite Problem | constructive algorithms data structures dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 3652 | Almost Triple Deletions | data structures dp greedy | Statement | D | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1750.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 7220 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 1119 | Puzzle | dp greedy | Statement | F | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 3000.0 | 103978 | 2600 |
| 23777 | Optimal Path | dp greedy math | Statement | A | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 500.0 | 103978 | 800 |
| 1426 | Text Editor | brute force dp greedy strings two pointers | Statement | E | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 32970 | Yet Another Problem About Pairs Satisfying an Inequality | binary search data structures dp greedy sortings | Statement | F | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 13151 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 7833 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 16339 | Qpwoeirut And The City | dp greedy implementation | Statement | C | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 17657 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 733 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 10556 | Color with Occurrences | dp greedy strings | Statement | D | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 6018 | Burenka and Traditions (hard version) | data structures dp greedy math two pointers | Statement | A2 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6519 | Burenka and Traditions (easy version) | dp greedy math | Statement | A1 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 3609 | Graph Cost | dp greedy math number theory | Statement | E | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 17680 | Ugu | dp greedy | Statement | B | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 900 |
| 4867 | Zero-One (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15253 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 7203 | Slime Escape | data structures dp greedy two pointers | Statement | D | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2000.0 | Codeforces Round #822 (Div.2) Editorial | |
| 918 | Swap and Take | dp greedy | Statement | E | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2500.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 585 | Anti-Increasing Addicts | constructive algorithms dfs and similar dp greedy | Statement | G | Codeforces Global Round 22 {1738} | PROGRAMMING | 3000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 13117 | Even Number Addicts | dp games greedy math | Statement | C | Codeforces Global Round 22 {1738} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 5175 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 1957 | FTL | binary search dp greedy | Statement | E | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2400 | |
| 5203 | Paths on the Tree | dfs and similar dp greedy sortings trees | Statement | D | Codeforces Global Round 23 {1746} | PROGRAMMING | 1500.0 | Codeforces Global Round 23 Editorial | |
| 13400 | Zero-Sum Prefixes | brute force data structures dp greedy implementation | Statement | C | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1500.0 | Codeforces Round #833 (Div. 2) Editorial | 1600 |
| 1719 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 16656 | Make Nonzero Sum (easy version) | constructive algorithms dp greedy | Statement | A1 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1300 |
| 11821 | Make Nonzero Sum (hard version) | constructive algorithms dp greedy | Statement | A2 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1500 |
| 1474 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 6933 | Torus Path | dp greedy math | Statement | K | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 11067 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 11419 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 13436 | Ice and Fire | constructive algorithms dp greedy | Statement | C | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 4052 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 926 | Laboratory on Pluto | brute force combinatorics dp fft greedy math | Statement | F | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 3000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 3997 | The Human Equation | data structures dp dsu greedy | Statement | E | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2250.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 9208 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 8520 | Remove the Bracket | dp greedy math | Statement | C | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1750.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1040 | Serval and Brain Power | brute force dp dp greedy implementation | Statement | F | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 1391 | Velepin and Marketing | data structures dp greedy sortings | Statement | E | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 2500.0 | Codeforces Round #852 Editorial | |
| 7279 | Moscow Gorillas | dp greedy implementation two pointers | Statement | D | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1750.0 | Codeforces Round #852 Editorial | |
| 1438 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 5628 | Maximum Subarray | data structures dp greedy | Statement | D | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 1083 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 1446 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 4220 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 7818 | Buying gifts | data structures dp greedy sortings | Statement | B | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1000.0 | Codeforces Round #857 Editorial | |
| 3014 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 5385 | Accommodation | dp greedy | Statement | D | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1500.0 | Nebius Welcome Round Editorial | |
| 9891 | A Wide, Wide Graph | dfs and similar dp dsu greedy trees | Statement | D | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 22903 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 30232 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 7480 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 2797 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 1761 | LuoTianyi and XOR-Tree | data structures dfs and similar dp dsu greedy trees | Statement | C | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 1750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2500 |
| 16244 | Running Miles | brute force dp greedy | Statement | D | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2000.0 | Codeforces Round #870 (Div. 2) Editorial | 1700 |
| 4676 | Range Sorting (Easy Version) | binary search dp dsu greedy trees two pointers | Statement | B1 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2000 |
| 2423 | Range Sorting (Hard Version) | binary search data structures dp greedy | Statement | B2 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2400 |
| 6624 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 1613 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 9301 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 5435 | Pairs of Segments | data structures dp greedy sortings | Statement | D | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 1917 | Tenzing and Triangle | data structures dp greedy | Statement | E | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2000.0 | CodeTON Round 5 Editorial | |
| 176 | Tenzing and Necklace | divide and conquer dp greedy | Statement | I | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 5000.0 | CodeTON Round 5 Editorial | |
| 17232 | Tenzing and Balls | dp greedy | Statement | C | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1000.0 | CodeTON Round 5 Editorial | |
| 6542 | Omsk Metro (simple version) | data structures dfs and similar dp greedy math trees | Statement | F1 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 17302 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 9414 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 6172 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 15074 | Vampiric Powers, anyone? | bitmasks brute force data structures dp greedy | Statement | C | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1500.0 | Tutorial | |
| 10605 | Array Painting | brute force constructive algorithms dp greedy | Statement | D | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 13779 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 681 | Miriany and Matchstick | constructive algorithms dp greedy | Statement | D | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 2192 | Ina of the Mountain | data structures dp greedy math | Statement | C | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 1250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 3278 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 8121 | Andrey and Escape from Capygrad | binary search data structures dp dsu greedy sortings two pointers | Statement | D | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1750.0 | Video solutions from Geothermal. | |
| 18977 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 8174 | Sorting By Multiplication | dp greedy math | Statement | D | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 7782 | Matrix Cascade | brute force constructive algorithms dp greedy | Statement | D | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 1619 | Digital Wallet | dp greedy | Statement | D | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 2826 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 127 | Min-Sum-Max | dp greedy | Statement | E | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 2500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 2267 | Jellyfish and EVA | dp graphs greedy math probabilities | Statement | C | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 29805 | Make it Alternating | combinatorics dp greedy | Statement | C | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 1300 | |
| 7454 | Tree XOR | bitmasks dfs and similar dp greedy trees | Statement | D | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 14686 | Card Game | dp greedy | Statement | C | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1500.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 4014 | Doremy's Drying Plan (Easy Version) | brute force data structures dp greedy sortings | Statement | C1 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 2067 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 2639 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 14970 | Theofanis' Nightmare | constructive algorithms dp greedy | Statement | C | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 31357 | Collecting Game | binary search dp greedy two pointers | Statement | B | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 10784 | Bicycles | dp graphs greedy implementation shortest paths sortings | Statement | G | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 35920 | Unnatural Language Processing | dp greedy implementation strings | Statement | D | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 6580 | Blocking Elements | binary search data structures dp greedy implementation two pointers | Statement | D | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 2000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 17294 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 31183 | Grouping Increases | data structures dp greedy | Statement | C | Hello 2024 {1919} | PROGRAMMING | 1000.0 | 1400 | |
| 23577 | Summation Game | dp games greedy sortings | Statement | B | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 20173 | Monsters Attack! | dp greedy implementation | Statement | B | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 17171 | Did We Get Everything Covered? | constructive algorithms dp greedy strings | Statement | A | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 4732 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 36393 | Find the Different Ones! | binary search brute force data structures dp greedy two pointers | Statement | D | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2112 | Paint Charges | data structures dp greedy math | Statement | G | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2299 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 17690 | Sasha and the Casino | binary search brute force dp games greedy math | Statement | C | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 2176 | Sasha and the Happy Tree Cutting | bitmasks brute force dp fft graphs greedy trees | Statement | E | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2500.0 | Codeforces Round #926 (Div. 2) Editorial. |