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 |
|---|---|---|---|---|---|---|---|---|---|
| 9538 | Unmerge | combinatorics dp two pointers | Statement | B | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 1500.0 | Codeforces Round #658 Editorial | 1800 |
| 5431 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 896 | Graph | *special dfs and similar dp math | Statement | A | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 10402 | 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 |
| 20253 | Array Walk | dp greedy math | Statement | B | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 674 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 9747 | 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 | |
| 36156 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 11360 | Zigzags | brute force data structures dp math two pointers | Statement | D | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 1349 | Fancy Fence | *special data structures dp dsu math sortings | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 75 | Chess Rush | *special combinatorics dp implementation math | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 196 | Bitwise Magic | dp math | Statement | I | Grakn Forces 2020 {1408} | PROGRAMMING | 3750.0 | Grakn Forces -- Editorial | |
| 8802 | Bargain | dp math probabilities | Statement | C | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 880 | Bubble Cup hypothesis | constructive algorithms dp math | Statement | J | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 897 | Danger of Mad Snakes | combinatorics dp math | Statement | D | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2300 | |
| 865 | Yet Another DAG Problem | bitmasks dp flows math | Statement | G | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 21737 | Number of Apartments | brute force dp math | Statement | A | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 1602 | Emotional Fishermen | combinatorics dp math | Statement | F | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 8668 | Radio Towers | combinatorics dp math | Statement | D | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 20748 | Move and Turn | dp math | Statement | B | Codeforces Round 691 (Div. 2) {1459} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 601 | 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 | |
| 36377 | Unique Number | dp greedy math | Statement | C | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 489 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 3987 | Sum of Paths | combinatorics dp math | Statement | D | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1750.0 | Codeforces Round #695 (Div. 2) Editorial | 2200 |
| 454 | Tiles | combinatorics dp fft math | Statement | G | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 57058 | New Year's Number | brute force dp math | Statement | B | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 7785 | Strange Beauty | dfs and similar dp math number theory | Statement | G | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 18990 | Nezzar and Lucky Number | brute force dp math | Statement | B | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 7462 | 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 | |
| 4425 | 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 | |
| 264 | School Clubs | dp fft math number theory probabilities | Statement | E | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #700 | |
| 17896 | Replace and Keep Sorted | dp implementation math | Statement | B | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #701 (Div. 2) | 1200 |
| 699 | String Counting | combinatorics dp math | Statement | G | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 9092 | 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 |
| 1910 | 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 |
| 1053 | 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 | |
| 888 | 2-Coloring | combinatorics dp math | Statement | E | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 2500.0 | T | 3100 |
| 4414 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 2113 | Digits | brute force dp math number theory | Statement | D | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 2891 | Colorings and Dominoes | combinatorics dp math | Statement | E | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 541 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 9246 | Short Task | brute force dp math number theory | Statement | G | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 4453 | Phoenix and Computers | combinatorics dp math | Statement | E | Codeforces Global Round 14 {1515} | PROGRAMMING | 2750.0 | Editorial | |
| 14052 | Baby Ehab Partitions Again | bitmasks constructive algorithms dp math | Statement | C | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1500.0 | Codeforces round #717 editorial | |
| 1002 | Baby Ehab Plays with Permutations | combinatorics dp math | Statement | E | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2750.0 | Codeforces round #717 editorial | |
| 17530 | Maximum Sum of Products | brute force dp implementation math ternary search two pointers | Statement | D | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 33356 | The Cake Is a Lie | dp math | Statement | B | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 28429 | Arranging The Sheep | dp greedy math | Statement | E | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2365 | Assimilation IV | combinatorics dp math probabilities | Statement | E | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 36530 | I Hate 1111 | dp math number theory | Statement | B | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 13768 | Little Alawn's Puzzle | combinatorics dfs and similar dp dsu graphs math | Statement | C | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 22146 | Interesting Function | binary search dp math | Statement | F | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 2983 | Tree Array | brute force combinatorics dp math probabilities trees | Statement | B | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 1250.0 | Tutorial | |
| 748 | Converging Array (Easy Version) | dp math | Statement | C1 | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 1500.0 | Tutorial | |
| 556 | Converging Array (Hard Version) | dp math | Statement | C2 | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 750.0 | Tutorial | |
| 1433 | Abnormal Permutation Pairs (easy version) | combinatorics dp fft math | Statement | E1 | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 2000.0 | ||
| 2915 | Priority Queue | combinatorics dp implementation math | Statement | D | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 2000.0 | ||
| 1012 | Abnormal Permutation Pairs (hard version) | combinatorics dp math | Statement | E2 | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 1000.0 | ||
| 2162 | RPD and Rap Sheet (Hard Version) | constructive algorithms dp interactive math | Statement | D2 | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1250.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 2015 | The Three Little Pigs | combinatorics dp fft math | Statement | C | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1750.0 | Codeforces Round 736 Editorial | |
| 7861 | Array Differentiation | bitmasks dp graphs math | Statement | D | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.0 | Editorial of Global Round 15 | |
| 1370 | You | dfs and similar dp math number theory | Statement | E | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #735 (Div. 2) | 2600 |
| 1415 | Sports Betting | bitmasks combinatorics dp graphs math probabilities | Statement | F | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2500.0 | 94384 | 2500 |
| 10459 | Moamen and XOR | bitmasks combinatorics dp math | Statement | C | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 1750.0 | Codeforces Round #737 Editorial | |
| 5260 | Up the Strip | brute force dp math number theory | Statement | B | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 1250.0 | Codeforces Round #740 Editorial | 1900 |
| 2703 | Mocha and Stars | combinatorics dp fft math number theory | Statement | E | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 3000.0 | Tutorial (en) | 2200 |
| 6087 | 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 |
| 2240 | 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) | |
| 6641 | Two Hundred Twenty One (easy version) | constructive algorithms dp math | Statement | D1 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 152 | Xor-quiz | constructive algorithms dp interactive math number theory | Statement | H | Codeforces Global Round 16 {1566} | PROGRAMMING | 3750.0 | Codeforces Global Round 16 Editorial | |
| 1276 | Mathematics Curriculum | combinatorics dp trees | Statement | B | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 2600 |
| 4196 | 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 | |
| 1662 | Non-equal Neighbours | combinatorics dp math | Statement | F | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 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 | |
| 40328 | 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) | ||
| 2648 | Red-Black Number | dp implementation math | Statement | F | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 5553 | Half of Same | dp math number theory | Statement | D2 | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 1606 | Rubik's Cube Coloring (hard version) | brute force dp implementation math trees | Statement | E2 | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 2300 |
| 346 | October 18, 2017 | combinatorics dp implementation math | Statement | F | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 3750.0 | Editorial of Codeforces Round #752 | |
| 2259 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 11282 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 1147 | LEGOndary Grandmaster | combinatorics dp math | Statement | F | Codeforces Global Round 18 {1615} | PROGRAMMING | 3000.0 | Global Round 18 Editorial | |
| 1696 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 5555 | Keep the Average High | dp greedy math | Statement | D | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2000.0 | Good Bye 2021 -- Editorial | 2000 |
| 1228 | Keep XOR Low | bitmasks combinatorics divide and conquer dp math | Statement | H | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 4000.0 | Good Bye 2021 -- Editorial | 3000 |
| 1008 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 20857 | Array and Operations | dp greedy math | Statement | D | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 10188 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7262 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1153 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1467 | Robot Cleaner Revisit | dp implementation math probabilities | Statement | D | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 900 | A Random Code Problem | combinatorics dp math number theory | Statement | F | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 9335 | Not Adding | dp math number theory | Statement | D | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 5313 | 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 | |
| 7040 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 15445 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 8884 | Yet Another Minimization Problem | dp math | Statement | D | Codeforces Global Round 19 {1637} | PROGRAMMING | 2000.0 | Tutorial | |
| 5691 | Madoka and the Best School in Russia | dp math number theory | Statement | D | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2000.0 | Codeforces Round #777 Editorial | |
| 5282 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 2477 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 1174 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 14952 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 803 | Centroid Probabilities | combinatorics dp fft math | Statement | E | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2750.0 | Codeforces Round #783 Editorial | 3000 |
| 423 | Permutation Counting | brute force combinatorics dp fft math | Statement | F | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 17906 | Palindrome Basis | dp math number theory | Statement | C | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 1500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 2891 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 1454 | Tokitsukaze and Permutations | dp math | Statement | D | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 2000.0 | Tutorial | |
| 110 | Tokitsukaze and Gems | dp math | Statement | F | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 3500.0 | Tutorial | |
| 771 | Formalism for Formalism | bitmasks dp math | Statement | F | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 3000.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 1130 | K-Set Tree | combinatorics dfs and similar dp math trees | Statement | F | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 9533 | Gambling | data structures dp math | Statement | H | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 203 | 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 | |
| 1368 | Three Days Grace | dp math two pointers | Statement | E | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 2500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 6976 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 23653 | Optimal Path | dp greedy math | Statement | A | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 500.0 | 103978 | 800 |
| 12698 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 17473 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 889 | Partial Virtual Trees | combinatorics dp math trees | Statement | D | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1750.0 | 104930 | |
| 678 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 18847 | Build Permutation | constructive algorithms dp math | Statement | C | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1750.0 | Codeforces Round #812 (Div. 2) Editorial | 1200 |
| 681 | Lost Array | bitmasks combinatorics constructive algorithms dp math | Statement | F | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 3000.0 | Codeforces Round #812 (Div. 2) Editorial | 2900 |
| 6110 | Chip Move | brute force dp math | Statement | D | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 5898 | 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 | |
| 6403 | 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 | |
| 846 | Function Sum | brute force combinatorics dp fft math | Statement | F | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2750.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 3465 | 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 | |
| 17216 | Ugu | dp greedy | Statement | B | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 900 |
| 15004 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1481 | Conveyor | dp math | Statement | E | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 2750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 967 | Zeros and Ones | bitmasks divide and conquer dp math | Statement | F | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 3250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 1792 | Balance Addicts | combinatorics dp math two pointers | Statement | E | Codeforces Global Round 22 {1738} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 12741 | 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> | |
| 1065 | Conditional Mix | combinatorics dp math | Statement | F | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2500.0 | Tutorial | 2600 |
| 1793 | Intersection and Union | combinatorics data structures dp math matrices | Statement | F | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2300 | |
| 304 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 483 | Joking (Hard Version) | dp interactive | Statement | E2 | Codeforces Global Round 23 {1746} | PROGRAMMING | 1750.0 | Codeforces Global Round 23 Editorial | |
| 1655 | 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 | |
| 7334 | Count GCD | bitmasks combinatorics dp math number theory | Statement | D | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 352 | Doping | dp dp math math | Statement | G | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 5255 | Wish I Knew How to Sort | dp math probabilities | Statement | C | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 1750.0 | Tutorial | 2000 |
| 2760 | Carry Bit | bitmasks brute force combinatorics dp math | Statement | D | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 102 | Anti-median (Hard Version) | combinatorics dp math | Statement | F2 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 254 | Anti-median (Easy Version) | dp math | Statement | F1 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 2341 | Valid Bitonic Permutations | combinatorics dp implementation math | Statement | D | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 2198 | Node Pairs | dp graphs math | Statement | E | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 6750 | 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 | |
| 10500 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 1607 | Koxia and Tree | combinatorics dp math probabilities trees | Statement | E | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2000.0 | Good Bye 2022 -- Editorial | |
| 545 | Game of Questions | bitmasks dp math probabilities | Statement | G | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2800 | ||
| 857 | 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 | |
| 3850 | 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 | |
| 86 | Uniform Chemistry | dp math | Statement | K | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 3388 | Flexible String Revisit | combinatorics dp math probabilities | Statement | D | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 862 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 1312 | Bracket Insertion | brute force combinatorics constructive algorithms dp math trees | Statement | F | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3250.0 | Tutorial | |
| 8257 | 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 | |
| 4635 | Moving Dots | binary search brute force combinatorics dp math two pointers | Statement | D | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2250.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 4450 | Counting Factorizations | combinatorics dp math number theory | Statement | D | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 2375 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 12143 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 643 | Gifts from Grandfather Ahmed | dp math number theory | Statement | F | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 860 (Div. 2) | 2500 |
| 1064 | Count Voting | combinatorics dp math | Statement | G | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3000.0 | Codeforces Round #854 Editorial | |
| 1399 | 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 | |
| 1184 | DSU Master | combinatorics dp dsu math | Statement | D | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 27659 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 564 | Minibuses on Venus (hard version) | brute force combinatorics dp math | Statement | E3 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 2800 |
| 1066 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 2117 | Vlad and the Nice Paths (hard version) | binary search combinatorics data structures dp math two pointers | Statement | G2 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 14374 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 2480 | Vlad and the Nice Paths (easy version) | combinatorics dp math | Statement | G1 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 1488 | XOR Counting | bitmasks combinatorics dp math | Statement | D | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #865 | 2600 |
| 419 | Bosco and Particle | dp math number theory strings | Statement | E | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #865 | 3100 |
| 1733 | The Fox and the Complete Tree Traversal | constructive algorithms dp games implementation math trees | Statement | C | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 935 | Timber | combinatorics dp fft math | Statement | F | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 2696 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 1283 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 15015 | Hits Different | data structures dp implementation math | Statement | G | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1600 | |
| 10723 | Don't Blame Me | bitmasks combinatorics dp math | Statement | H | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1700 | |
| 274 | Old Mobile | dp math probabilities | Statement | E | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 2250.0 | Codeforces Round 880 Editorial | |
| 1848 | Count Supersequences | combinatorics dp math | Statement | E | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 2250.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 9032 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 1568 | Tenzing and Random Operations | combinatorics dp math probabilities | Statement | G | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 3000.0 | CodeTON Round 5 Editorial | |
| 2105 | Omsk Metro (hard version) | data structures dfs and similar divide and conquer dp implementation math trees | Statement | F2 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 6329 | 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 | ||
| 280 | Multiple of Three Cycles | combinatorics dp dsu math | Statement | H | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 4000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 8991 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 1590 | Boxes and Balls | dp implementation math | Statement | E | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 2088 | 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 | |
| 1777 | Expected Destruction | dp math probabilities | Statement | C | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 18616 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 2108 | Maximum Monogonosity | brute force dp math | Statement | E | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 2250.0 | Video solutions from Geothermal. | |
| 7928 | Sorting By Multiplication | dp greedy math | Statement | D | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 492 | Asterism Stream | dp math matrices probabilities | Statement | H | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 3500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 967 | Mighty Rock Tower | combinatorics dp math probabilities | Statement | M | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 2739 | 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 | |
| 1369 | Travel Plan | combinatorics divide and conquer dp math trees | Statement | C | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 13084 | Colorful Table | binary search data structures dp implementation math sortings two pointers | Statement | C | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1387 | Jellyfish and Math | bitmasks dp graphs shortest paths | Statement | B | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 2169 | 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 | |
| 572 | Jellyfish and Hack | dp math | Statement | E | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 3000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 927 | Jellyfish and Miku | dp math probabilities | Statement | D | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 2250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 4030 | Counting Rhyme | brute force combinatorics dp math number theory sortings | Statement | D | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 2500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 12991 | Torn Lucky Ticket | brute force dp hashing implementation math | Statement | C | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 116 | Cyclic Hamming (Easy Version) | divide and conquer dp fft math number theory | Statement | H1 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 4000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 141 | Cyclic Hamming (Hard Version) | dp fft math number theory | Statement | H2 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 20428 | Laura and Operations | dp math | Statement | B | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 1000.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 2503 | 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 | |
| 14426 | Theofanis' Nightmare | constructive algorithms dp greedy | Statement | C | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 1263 | One-X | combinatorics dp math | Statement | E | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2250.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 174 | Short Permutation Problem | combinatorics dp fft math | Statement | I | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 6000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 2252 | Small Permutation Problem (Easy Version) | combinatorics dp math | Statement | F1 | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 1225 | Small Permutation Problem (Hard Version) | combinatorics dp math | Statement | F2 | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 2385 | Light Bulbs (Easy Version) | brute force combinatorics dfs and similar dp dsu graphs math | Statement | G1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 713 | Matrix Rank (Easy Version) | brute force combinatorics dp math matrices | Statement | H1 | Good Bye 2023 {1916} | PROGRAMMING | 2750.0 | ||
| 628 | Matrix Rank (Hard Version) | combinatorics dp math matrices | Statement | H2 | Good Bye 2023 {1916} | PROGRAMMING | 1750.0 | ||
| 16586 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 1126 | Counting Prefixes | combinatorics dp math | Statement | E | Hello 2024 {1919} | PROGRAMMING | 2250.0 | 2600 | |
| 6472 | Array Repetition | binary search data structures dp implementation math | Statement | D | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 3369 | Counting Binary Strings | combinatorics dp math strings | Statement | E | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2250.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 1413 | Balanced Subsequences | combinatorics dp math | Statement | D | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 1750.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 4756 | Good Trip | combinatorics dp math probabilities | Statement | D | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 1750.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 14797 | Vlad and an Odd Ordering | binary search bitmasks data structures dp implementation math number theory | Statement | E | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 1976 | Paint Charges | data structures dp greedy math | Statement | G | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2088 | 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 | |
| 17241 | 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. | |
| 5740 | Sasha and a Walk in the City | combinatorics dfs and similar dp math trees | Statement | D | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 4843 | Sum over all Substrings (Easy Version) | brute force dp greedy strings | Statement | D1 | think-cell Round 1 {1930} | PROGRAMMING | 1250.0 | think-cell Round 1 Editorial | |
| 3044 | Sum over all Substrings (Hard Version) | dp greedy strings | Statement | D2 | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 21966 | Yet Another Coin Problem | brute force dp greedy math | Statement | B | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1000.0 | Tutorial | |
| 39071 | Rudolf and the Ugly String | dp strings | Statement | C | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 1234 | Nobody is needed | brute force data structures dp math number theory | Statement | F | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 3165 | Girl Permutation | combinatorics dp math number theory | Statement | E | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2250.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 8005 | Colored Balls | combinatorics dp greedy math sortings | Statement | D | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 355 | Unique Strings | combinatorics dp math | Statement | F | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 5864 | GCD on a grid | brute force dfs and similar dp math number theory | Statement | G | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 8686 | Unfair Game | dp games greedy math | Statement | F | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 11898 | How Does the Rook Move? | combinatorics dp math | Statement | C | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1500.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1600 |
| 5775 | A BIT of an Inequality | bitmasks brute force dp math | Statement | D | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1750.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1900 |
| 1616 | Carousel of Combinations | brute force combinatorics dp math number theory | Statement | E | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2400 |
| 2227 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 377 | Again Counting Arrays (Easy Version) | combinatorics dp fft math | Statement | E1 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 3100 |
| 212 | Again Counting Arrays (Hard Version) | combinatorics dp math | Statement | E2 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1000.0 | Tutorial | 3500 |
| 2494 | Division + LCP (hard version) | binary search brute force data structures dp hashing math string suffix structures strings | Statement | G2 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 2200 | |
| 28470 | Chess For Three | brute force dp implementation math | Statement | A | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #945 (Div. 2) | 900 |
| 1035 | Set | bitmasks brute force combinatorics dfs and similar divide and conquer dp math | Statement | F | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2500.0 | editorial_zh.pdf | 2600 |
| 8011 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 1895 | Number of k-good subarrays | bitmasks combinatorics divide and conquer dp math meet-in-the-middle | Statement | E | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 2500.0 | 130839 | |
| 17932 | Mathematical Problem | brute force dp two pointers | Statement | D | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 10824 | Beautiful Array | dp math sortings | Statement | E | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 26939 | Split the Multiset | brute force dp greedy math | Statement | A | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 958 (Div. 2) |