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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5015 | Number With The Given Amount Of Divisors | brute force dp number theory | Statement | E | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2100 | |
| 721 | Moon Craters | dp sortings | Statement | C | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Tutorial | 2300 | |
| 1756 | First Digit Law | dp math probabilities | Statement | C | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2000 | |
| 4931 | Beautiful numbers | dp number theory | Statement | D | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 2400 | |
| 7467 | Round Table Knights | dp math number theory | Statement | C | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 1600 | |
| 2249 | Beaver Game | dp games number theory | Statement | C | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 1900 | |
| 1093 | Numbers | dp math number theory | Statement | D | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2400 | |
| 556 | Lostborn | dp math number theory | Statement | E | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2600 | |
| 703 | Periodical Numbers | combinatorics dp number theory | Statement | E | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 2600 | |
| 626 | Gifts | combinatorics dp math probabilities | Statement | E | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 2500 | |
| 993 | Number Challenge | combinatorics dp implementation math number theory | Statement | E | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 2600 | |
| 1163 | Number Transformation | dp greedy number theory | Statement | C | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 2500 | |
| 12465 | Good Sequences | dp number theory | Statement | B | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 1700 | |
| 1640 | Beautiful Decomposition | dp games greedy number theory | Statement | E | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Codeforces Round #171 (Div. 2) Разбор Задач | 2100 | |
| 718 | Cows and Cool Sequences | dp math number theory | Statement | D | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 2400 | |
| 3393 | Vasya and Beautiful Arrays | brute force dp number theory | Statement | C | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2000 | |
| 10863 | Bear and Prime Numbers | binary search brute force data structures dp implementation math number theory | Statement | C | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1800 | |
| 4794 | Roman and Numbers | bitmasks brute force combinatorics dp number theory | Statement | D | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2000 | |
| 2815 | Upgrading Array | dp greedy math number theory | Statement | D | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2000 | |
| 30962 | Mashmokh and ACM | combinatorics dp number theory | Statement | B | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 357 | Jzzhu and Squares | dp math number theory | Statement | E | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2900 | |
| 6057 | Pashmak and Graph | dp sortings | Statement | E | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 2100 | |
| 1283 | Traffic Jams in the Land | data structures dp number theory | Statement | D | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2400 | |
| 2156 | Pluses everywhere | combinatorics dp math number theory | Statement | E | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 2500 | |
| 543 | Superhero's Job | dfs and similar dp hashing math number theory | Statement | D | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 14173 | Soldier and Number Game | constructive algorithms dp math number theory | Statement | D | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1700 | |
| 3593 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 5907 | Vanya and Scales | brute force dp greedy math meet-in-the-middle number theory | Statement | C | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1800 | |
| 8565 | Gerald and Giant Chess | combinatorics dp math number theory | Statement | C | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2500 | |
| 4373 | Clique in the Divisibility Graph | dp math number theory | Statement | F | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1600 | |
| 2408 | Symmetric and Transitive | combinatorics dp math | Statement | B | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 2100 | |
| 848 | Number of Binominal Coefficients | dp math number theory | Statement | D | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 3100 | |
| 2441 | Array GCD | dp greedy number theory | Statement | B | AIM Tech Round (Div. 1) {623} | PROGRAMMING | AIM Tech Round Tutorial | 2400 | |
| 1606 | Little Artem and Random Variable | dp implementation math probabilities | Statement | D | VK Cup 2016 - Round 2 {641} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 2300 | |
| 2263 | Table Compression | dfs and similar dp dsu graphs greedy | Statement | C | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 2300 | |
| 1348 | Fence Divercity | combinatorics dp number theory | Statement | G | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 2500 | |
| 842 | Four Divisors | dp math number theory | Statement | F | Educational Codeforces Round 12 {665} | PROGRAMMING | Editorial | 2600 | |
| 1487 | Couple Cover | brute force dp number theory | Statement | F | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 2300 | |
| 704 | Mishka and Divisors | dp number theory | Statement | E | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 2900 | |
| 621 | Black Widow | dp graphs implementation math | Statement | C | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 2800 | |
| 1154 | PolandBall and Many Other Balls | combinatorics divide and conquer dp fft math number theory | Statement | G | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 3100 | |
| 1645 | Bash Plays with Functions | brute force combinatorics dp number theory | Statement | E | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2400 | |
| 120 | Math, math everywhere | brute force dp math meet-in-the-middle number theory | Statement | G | Codeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {765} | PROGRAMMING | Codeforces Round #397 Editorial | 2800 | |
| 1498 | Vulnerable Kerbals | constructive algorithms dp graphs math number theory | Statement | C | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 2400 | |
| 396 | Test Data Generation | combinatorics divide and conquer dp fft math number theory | Statement | F | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 3400 | |
| 3993 | Anton and School - 2 | combinatorics dp math number theory | Statement | D | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | Editorial | 2200 | |
| 5132 | Divide by Three | dp greedy math number theory | Statement | C | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 2000 | |
| 6448 | Mike and gcd problem | dp greedy number theory | Statement | C | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 1700 | |
| 221 | Fake bullions | combinatorics dfs and similar dp graphs number theory | Statement | F | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 3400 | |
| 3312 | My pretty girl Noora | brute force dp greedy math number theory | Statement | D | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 1800 | |
| 3729 | Winter is here | combinatorics dp math number theory | Statement | D | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 2200 | |
| 9851 | Maximum splitting | dp greedy math number theory | Statement | C | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 1300 | |
| 15236 | Pride | brute force dp greedy math number theory | Statement | A | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 1600 | |
| 4358 | Counting Arrays | combinatorics dp math number theory | Statement | E | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 2000 | |
| 3983 | Unusual Sequences | bitmasks combinatorics dp math number theory | Statement | D | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2100 | |
| 32137 | Perfect Number | binary search brute force dp implementation number theory | Statement | B | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1100 | |
| 770 | Divisibility | constructive algorithms dp greedy number theory | Statement | F | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2500 | |
| 2272 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 3104 | Perfect Groups | dp math number theory | Statement | D | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2100 | |
| 2447 | GCD Counting | divide and conquer dp dsu number theory trees | Statement | G | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2400 | |
| 11631 | Polycarp and Div 3 | dp greedy number theory | Statement | D | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1500 | |
| 4322 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 1152 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 3213 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 11202 | Multiplicity | data structures dp implementation math number theory | Statement | C | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1700 | |
| 2687 | Find a Number | dp graphs number theory shortest paths | Statement | A | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2200 | |
| 3348 | Makoto and a Blackboard | dp math number theory probabilities | Statement | D | Hello 2019 {1097} | PROGRAMMING | 64310 | 2200 | |
| 5616 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 3937 | Compression | dp implementation math number theory | Statement | D | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1800 | |
| 1555 | Sasha and Interesting Fact from Graph Theory | brute force combinatorics dp math trees | Statement | D | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2600 | |
| 2848 | Steps to One | dp math number theory probabilities | Statement | D | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2300 | |
| 1853 | Ehab and the Expected GCD Problem | combinatorics dp math number theory | Statement | E | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2500 | |
| 3490 | Product Oriented Recurrence | dp math matrices number theory | Statement | E | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2200 | |
| 1257 | Crossword Expert | combinatorics dp number theory probabilities two pointers | Statement | F | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2500 | |
| 1245 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 2302 | Natasha, Sasha and the Prefix Sums | combinatorics dp math number theory | Statement | E | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2400 | |
| 680 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 7908 | Ivan the Fool and the Probability Theory | combinatorics dp math | Statement | A | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1700 | |
| 2894 | Cards | combinatorics dp math number theory probabilities | Statement | F | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2600 | |
| 1069 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 1209 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 31182 | Orac and Models | dp math number theory | Statement | B | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 1000.0 | Codeforces Round #641 Editorial | 1400 |
| 5946 | 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 | ||
| 2998 | 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 | ||
| 1289 | 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 | ||
| 8099 | Strange Beauty | dfs and similar dp math number theory | Statement | G | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 474 | School Clubs | dp fft math number theory probabilities | Statement | E | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #700 | |
| 9210 | Square-free division (easy version) | data structures dp greedy math number theory | Statement | E1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 1700 |
| 1968 | Square-free division (hard version) | data structures dp greedy hashing math number theory | Statement | E2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 2500 |
| 2153 | 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 | ||
| 9678 | Short Task | brute force dp math number theory | Statement | G | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 37941 | I Hate 1111 | dp math number theory | Statement | B | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 16430 | Diluc and Kaeya | dp hashing number theory | Statement | C | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 1500.0 | Codeforces Round #724 — Editorial | 1500 |
| 1447 | 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 |
| 5380 | 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 |
| 2825 | Mocha and Stars | combinatorics dp fft math number theory | Statement | E | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 3000.0 | Tutorial (en) | 2200 |
| 6200 | Up the Strip (simplified version) | brute force data structures dp math number theory | Statement | D1 | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1500.0 | Codeforces Round #740 Editorial | 1700 |
| 185 | Xor-quiz | constructive algorithms dp interactive math number theory | Statement | H | Codeforces Global Round 16 {1566} | PROGRAMMING | 3750.0 | Codeforces Global Round 16 Editorial | |
| 5637 | Half of Same | dp math number theory | Statement | D2 | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 2351 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 991 | Artistic Partition | divide and conquer dp number theory | Statement | D | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #752 | 3000 |
| 10573 | Complex Market Analysis | binary search dp implementation number theory schedules two pointers | Statement | C | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 1500.0 | Deltix Round, Autumn 2021. Editorial | 1400 |
| 4595 | Divan and Kostomuksha (easy version) | dp number theory | Statement | D1 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 2100 |
| 2818 | Divan and Kostomuksha (hard version) | dp number theory | Statement | D2 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1000.0 | Tutorial | 2300 |
| 1081 | 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) | |
| 1205 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 936 | A Random Code Problem | combinatorics dp math number theory | Statement | F | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 9601 | Not Adding | dp math number theory | Statement | D | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 2088 | Flipping Range | dp greedy number theory | Statement | D | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #768 | |
| 5469 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 7159 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 5741 | 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 | |
| 1260 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 19326 | Palindrome Basis | dp math number theory | Statement | C | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 1500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 7822 | 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 | |
| 1981 | Chopping Carrots (Hard Version) | constructive algorithms dp number theory two pointers | Statement | D2 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 187 | Bugaboo | bitmasks constructive algorithms dp number theory | Statement | F | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 3250.0 | 104930 | |
| 645 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 3590 | 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 | |
| 322 | Arranging Crystal Balls | data structures divide and conquer divide and conquer dp geometry graphs number theory | Statement | I | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3500.0 | Tutorial | 3500 |
| 7717 | 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 | |
| 11032 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 1643 | Divisors and Table | dp number theory shortest paths | Statement | E | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 4676 | Counting Factorizations | combinatorics dp math number theory | Statement | D | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 697 | 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 |
| 760 | Another n-dimensional chocolate bar | dp number theory | Statement | F | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 14798 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 491 | 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 |
| 4328 | 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 | |
| 214 | 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 | |
| 173 | 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 | |
| 239 | Optimizations From Chelsu | divide and conquer dp number theory trees | Statement | G | Good Bye 2023 {1916} | PROGRAMMING | 3750.0 | ||
| 15294 | 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 | ||
| 2269 | 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 | |
| 1298 | 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 | |
| 3267 | Girl Permutation | combinatorics dp math number theory | Statement | E | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2250.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 26857 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 6117 | GCD on a grid | brute force dfs and similar dp math number theory | Statement | G | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 1690 | 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 |
| 358 | Maximum GCD Sum Queries | bitmasks brute force dp implementation number theory | Statement | F | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #945 (Div. 2) | 3100 |
| 8225 | 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 |
| 7844 | Valuable Cards | dp greedy number theory two pointers | Statement | F | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 1030 | Court Blue (Easy Version) | brute force dfs and similar dp math number theory | Statement | F1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 603 | Court Blue (Hard Version) | brute force dp math number theory | Statement | F2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 1294 | Alter the GCD | binary search data structures divide and conquer dp number theory | Statement | D | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2250.0 | Discussion stream (With Hints) | |
| 4418 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | 134298 | |
| 4156 | Expected Power | bitmasks brute force dp math number theory probabilities | Statement | E | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2000.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 275 | Count Leaves | dp math number theory | Statement | F | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2750.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 200 | Rayan vs. Rayaneh | dp number theory | Statement | H | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 5000.0 | Rayan 2024 Selection Round Editorial | |
| 5552 | XORificator 3000 | bitmasks dp number theory | Statement | F | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 3932 | Natlan Exploring | combinatorics dp math number theory | Statement | G | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 1834 | Grid Walk | dp greedy math number theory | Statement | K | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 535 | Shohag Loves Counting (Easy Version) | combinatorics dp math number theory | Statement | F1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 5673 | Small Operations | binary search bitmasks brute force dfs and similar dp math number theory sortings | Statement | F | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 2106 | Build an Array | bitmasks dp math number theory | Statement | G | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 17504 | Gellyfish and Flaming Peony | brute force constructive algorithms dp greedy math number theory shortest paths | Statement | A | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 2586 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 266 | Beyond the Palindrome (Hard Version) | combinatorics dp math number theory | Statement | E2 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 2000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 1073 | Long Journey | dfs and similar dp graphs matrices number theory shortest paths | Statement | F | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 1298 | Attraction Theory | combinatorics dp implementation math | Statement | D | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 1594 | Omega Numbers | bitmasks dp math number theory | Statement | F | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2750.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 6803 | XOR-factorization | bitmasks constructive algorithms dp greedy number theory | Statement | C | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1500.0 | Codeforces Global Round 31 | |
| 3049 | LCM is Legendary Counting Master | dp math number theory | Statement | E | Hello 2026 {2183} | PROGRAMMING | 2250.0 | ||
| 2101 | Little String (Hard Version) | binary search combinatorics dp greedy math number theory | Statement | D2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 16469 | Product Queries | dp math number theory | Statement | E | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 24997 | A Simple Sequence | constructive algorithms dp greedy number theory | Statement | A | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 2446 | A Simple GCD Problem (Hard Version) | dp greedy number theory | Statement | C2 | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1000.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 1048 | Minimum Path Cover | dp interactive number theory trees | Statement | E | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 425 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 1044 | Elections in Saransk (hard version) | combinatorics dp fft math number theory | Statement | F2 | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 6466 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 13111 | Yaroslav and Productivity | constructive algorithms dp greedy math number theory | Statement | D | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial |