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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 19144 | Longest Regular Bracket Sequence | constructive algorithms data structures dp greedy sortings strings | Statement | C | Codeforces Beta Round 5 {5} | PROGRAMMING | C, D и E с CBR5 - разбор | 1900 | |
| 824 | Beads | dp graphs | Statement | E | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 2600 | |
| 461 | Smart Boy | dp games strings | Statement | F | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи D) | 2200 | |
| 740 | Writing a Song | brute force dp strings | Statement | D | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2100 | |
| 390 | Mutation | bitmasks dp math | Statement | C | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2700 | |
| 2169 | Beaver | data structures dp greedy hashing strings two pointers | Statement | C | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 Editorial | 1800 | |
| 975 | Genetic engineering | dp string suffix structures trees | Statement | C | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2400 | |
| 26402 | Password | binary search dp hashing string suffix structures strings | Statement | B | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 1800 | |
| 1804 | Palindromes | dp strings | Statement | D | Codeforces Beta Round 98 (Div. 2) {137} | PROGRAMMING | Codeforces Beta Round #98 (Div. 2): Editorial | 1900 | |
| 232 | Hellish Constraints | brute force dp two pointers | Statement | E | Codeforces Beta Round 99 (Div. 1) {138} | PROGRAMMING | Codeforces Beta Round #99: editorial | 2900 | |
| 786 | Mission Impassable | dp strings | Statement | D | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 2600 | |
| 4752 | Palindrome pairs | *special brute force dp strings | Statement | D | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2000 | |
| 2355 | e-Government | data structures dfs and similar dp strings trees | Statement | E | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2800 | |
| 14113 | Another Problem on Strings | binary search brute force dp math strings two pointers | Statement | C | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1600 | |
| 394 | Representative Sampling | dp sortings strings | Statement | F2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2400 | |
| 703 | Periodical Numbers | combinatorics dp number theory | Statement | E | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 2600 | |
| 2045 | Two Strings | data structures dp strings | Statement | B | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 2000 | ||
| 9674 | Queries for Number of Palindromes | dp hashing strings | Statement | H | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1900 | |
| 455 | Colorful Stones | dp two pointers | Statement | D | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial for E | 2400 | |
| 356 | Binary Key | dp greedy implementation | Statement | E | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 2600 | |
| 4449 | Lucky Common Subsequence | dp strings | Statement | B | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2000 | |
| 529 | Game with Strings | bitmasks dp games | Statement | B | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2500 | |
| 605 | Xenia and String Problem | dp hashing implementation string suffix structures strings | Statement | E | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2800 | |
| 980 | Diverse Substrings | dp strings two pointers | Statement | C | Testing Round 9 {386} | PROGRAMMING | 2100 | ||
| 2754 | Match & Catch | dp string suffix structures strings | Statement | D | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 2000 | |
| 12847 | Prefixes and Suffixes | dp string suffix structures strings two pointers | Statement | D | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 2000 | |
| 7174 | A Lot of Games | dfs and similar dp games implementation strings trees | Statement | B | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2100 | |
| 2099 | Fedor and Essay | dfs and similar dp graphs hashing strings | Statement | D | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | 2100 | ||
| 38407 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 2163 | Dreamoon and Strings | dp strings | Statement | E | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 2600 | |
| 621 | Dreamoon and Binary | dp strings | Statement | D | Codeforces Round 272 (Div. 1) {477} | PROGRAMMING | Разбор (англ.) | 2600 | |
| 1036 | Game with Strings | bitmasks dp probabilities | Statement | C | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2800 | |
| 3273 | Obsessive String | dp strings | Statement | B | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2300 | |
| 1042 | Mr. Kitayuta's Gift | combinatorics dp matrices strings | Statement | E | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2900 | |
| 6950 | A and B and Interesting Substrings | data structures dp two pointers | Statement | D | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | Editorial | 1900 | |
| 19445 | Reposts | *special dfs and similar dp graphs trees | Statement | A | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 2457 | Correcting Mistakes | constructive algorithms dp greedy hashing strings two pointers | Statement | E | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | Разбор VK Cup Round 2 | 1800 | |
| 2734 | Work Group | dfs and similar dp graphs strings trees | Statement | B | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 2000 | ||
| 44717 | Two Substrings | brute force dp greedy implementation strings | Statement | A | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 1772 | Vanya and Brackets | brute force dp expression parsing greedy implementation strings | Statement | E | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 2300 | |
| 1258 | Ann and Half-Palindrome | data structures dp graphs string suffix structures strings trees | Statement | E | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 2700 | |
| 1008 | LCS Again | dp greedy | Statement | D | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 2800 | |
| 953 | Digits of Number Pi | dp implementation strings | Statement | F | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 3200 | |
| 458 | Wilbur and Strings | dfs and similar dp graphs strings | Statement | E | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | Codeforces Round #331 Editorial | 2900 | |
| 2818 | New Year and Ancient Prophecy | dp hashing strings | Statement | D | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 1900 | |
| 542 | Puzzle Lover | dp hashing strings | Statement | E | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 3200 | |
| 2496 | Running Track | dp greedy strings trees | Statement | C | Codeforces Round 338 (Div. 2) {615} | PROGRAMMING | Codeforces Round #338 (Div. 2) editorial | 1900 | |
| 3087 | Famil Door and Brackets | dp strings | Statement | C | Codeforces Round 343 (Div. 2) {629} | PROGRAMMING | Editorial of Codeforces Round #343 (Div.2) | 2000 | |
| 3478 | Spy Syndrome 2 | data structures dp hashing implementation sortings string suffix structures strings | Statement | C | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 1900 | |
| 1438 | Intellectual Inquiry | dp greedy strings | Statement | E | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 2100 | |
| 5420 | Bear and Compressing | brute force dfs and similar dp strings | Statement | B | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 1300 | |
| 18947 | Simple Strings | dp greedy strings | Statement | C | Educational Codeforces Round 12 {665} | PROGRAMMING | Editorial | 1200 | |
| 3838 | Reberland Linguistics | dp implementation strings | Statement | A | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | Codeforces Round #349 Editorial | 1800 | |
| 23775 | Vasya and String | binary search dp strings two pointers | Statement | C | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | Editorial | 1500 | |
| 3580 | Alyona and Strings | dp strings | Statement | D | Codeforces Round 358 (Div. 2) {682} | PROGRAMMING | 45491 | 1900 | |
| 1713 | Legen... | data structures dp matrices strings | Statement | D | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 2700 | |
| 20283 | Hard problem | dp strings | Statement | C | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1600 | |
| 1978 | New Year and Old Subsequence | data structures divide and conquer dp matrices | Statement | E | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 2600 | |
| 1121 | Vladik and chat | brute force constructive algorithms dp implementation strings | Statement | C | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2200 | ||
| 2967 | Ability To Convert | constructive algorithms dp greedy math strings | Statement | D | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1900 | |
| 6059 | Dasha and Password | brute force dp implementation | Statement | C | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1600 | |
| 754 | Dasha and Photos | brute force data structures dp implementation | Statement | F | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 2900 | |
| 4977 | Mahmoud and a Message | brute force dp greedy strings | Statement | C | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 1700 | |
| 584 | Replace All | combinatorics dp math | Statement | G | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 3400 | ||
| 9361 | Mike and strings | brute force dp strings | Statement | B | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 1300 | |
| 4114 | Anthem of Berland | dp strings | Statement | G | Educational Codeforces Round 21 {808} | PROGRAMMING | 52010 | 2300 | |
| 8072 | An impassioned circulation of affection | brute force dp strings two pointers | Statement | C | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | Codeforces Round #418 (Div. 2) Editorial | 1600 | |
| 1236 | Liar | binary search dp hashing string suffix structures | Statement | E | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 2500 | |
| 2120 | String Compression | dp hashing string suffix structures strings | Statement | F | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2400 | |
| 4871 | Palindromic characteristics | brute force dp hashing strings | Statement | D | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 1900 | |
| 448 | Future Failure | dp games | Statement | C | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2800 | |
| 667 | Similar Words | dp strings | Statement | B | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2300 | |
| 165 | Hex Dyslexia | bitmasks brute force dp graphs | Statement | E | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2700 | |
| 1031 | Huge Strings | bitmasks brute force dp implementation strings | Statement | D | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2100 | |
| 1452 | Maximum Questions | data structures dp strings | Statement | E | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2300 | |
| 596 | Reverses | dp string suffix structures strings | Statement | E | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 3200 | |
| 878 | New Year and Entity Enumeration | bitmasks combinatorics dp math | Statement | E | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 3692 | The Monster | dp greedy implementation math | Statement | A | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1900 | |
| 1258 | Palindrome Partition | dp string suffix structures strings | Statement | G | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2900 | |
| 680 | Erasing Substrings | bitmasks dp greedy | Statement | F | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2600 | |
| 677 | Fibonacci String Subsequences | combinatorics dp matrices | Statement | F | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2500 | |
| 2037 | Short Code | data structures dp greedy strings trees | Statement | E | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 2500 | |
| 2271 | 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 |
| 7814 | Bishwock | dp greedy | Statement | D | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 1653 | Abbreviation | dp hashing strings | Statement | F | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2400 | |
| 1549 | Bracket Substring | dp strings | Statement | F | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2600 | |
| 20289 | Equalize | dp greedy strings | Statement | C | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 584 | Wrap Around | dp strings | Statement | F | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2900 | |
| 19735 | Vitamins | bitmasks brute force dp implementation | Statement | B | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 1328 | Vasya and Big Integers | binary search data structures dp hashing strings | Statement | E | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2500 | |
| 1157 | String Journey | data structures dp string suffix structures | Statement | F | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 3000 | |
| 642 | Speed Dial | dp strings trees | Statement | F | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2900 | |
| 268 | Mateusz and an Infinite Sequence | bitmasks brute force dp strings | Statement | H | Hello 2019 {1097} | PROGRAMMING | 64310 | 3000 | |
| 474 | Modest Substrings | dp strings | Statement | H | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3500 | |
| 2526 | Compress String | dp strings | Statement | C | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2200 | |
| 1034 | Morse Code | binary search data structures dp hashing sortings string suffix structures strings | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2300 | |
| 1299 | String Multiplication | dp greedy strings | Statement | E | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2200 | |
| 2086 | Three Religions | dp implementation strings | Statement | B | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2200 | |
| 2611 | Neko and Aki's Prank | dp greedy trees | Statement | D | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2000 | |
| 1680 | Mysterious Code | dp strings | Statement | D | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2200 | |
| 577 | Anagram Paths | dp implementation trees | Statement | D | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2900 | |
| 23377 | WOW Factor | dp strings | Statement | B | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 5596 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 3749 | Subsequences (hard version) | dp strings | Statement | H | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2200 | |
| 10573 | RGB Substring (hard version) | data structures dp implementation two pointers | Statement | D2 | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1600 | |
| 2804 | You Are Given a WASD-string... | brute force data structures dp greedy implementation math strings | Statement | C | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2100 | |
| 7218 | Treasure Island | dfs and similar dp flows hashing | Statement | D | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1800 | |
| 6547 | AB-string | binary search combinatorics dp strings | Statement | D | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1800 | |
| 506 | Find String in a Grid | data structures dp strings trees | Statement | D | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2900 | |
| 31563 | Yet Another Broken Keyboard | combinatorics dp implementation | Statement | C | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1100 | |
| 2412 | Two Bracket Sequences | dp strings two pointers | Statement | F | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 2400 | |
| 8812 | Dr. Evil Underscores | bitmasks brute force dfs and similar divide and conquer dp greedy strings trees | Statement | D | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1800 | |
| 14037 | Obtain The String | dp greedy strings | Statement | C | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1600 | |
| 53 | Paint the String | *special dp strings | Statement | H | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 3372 | Erase Subsequences | brute force dp greedy strings | Statement | E | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2200 | |
| 12823 | Cow and Message | brute force dp math strings | Statement | C | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1500 |
| 793 | Au Pont Rouge | binary search dp strings | Statement | C | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2800 |
| 9716 | Homecoming | binary search dp greedy strings | Statement | B | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1300 |
| 1090 | Wise Men (Easy Version) | bitmasks brute force dp meet-in-the-middle | Statement | F1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 2000.0 | 74961 | 2600 |
| 740 | Wise Men (Hard Version) | bitmasks dp math | Statement | F2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1500.0 | 74961 | 3200 |
| 625 | Letters and Question Marks | bitmasks dp string suffix structures | Statement | G | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2900 | |
| 607 | Elementary! | brute force dp strings | Statement | F | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 4211 | Kaavi and Magic Spell | dp strings | Statement | C | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 2200 |
| 36107 | Ternary String | binary search dp implementation two pointers | Statement | B | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1200 | |
| 13750 | Spy-string | bitmasks brute force constructive algorithms dp hashing strings | Statement | F | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1700 | |
| 1806 | Rotating Substrings | dp strings | Statement | F | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 3000.0 | 78202 | 2600 |
| 651 | Construct the String | dp strings | Statement | G | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 5305 | 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 | |
| 56626 | 01 Game | brute force constructive algorithms dp games implementation strings | Statement | B | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 728 | String Transformation 2 | dp graphs trees | Statement | C | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 20833 | Good String | brute force dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 10049 | 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 | |
| 522 | Twilight and Ancient Scroll (easier version) | dp hashing implementation string suffix structures strings | Statement | E1 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 529 | Twilight and Ancient Scroll (harder version) | dp implementation string suffix structures strings | Statement | E2 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 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 | ||
| 5265 | Subsequences of Length Two | dp greedy | Statement | F | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 6305 | Perform Easily | data structures dp implementation sortings two pointers | Statement | C | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 1500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 918 | Minlexes | dp greedy implementation strings | Statement | E | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 6431 | Number of Subsequences | combinatorics dp strings | Statement | F | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 2000 | |
| 9373 | Catching Cheaters | dp strings | Statement | B | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1000.0 | E | |
| 17501 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 18945 | Canine poetry | dp greedy strings | Statement | C | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 3338 | 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 | ||
| 61282 | Fair Division | dp greedy | Statement | B | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 58797 | New Year's Number | brute force dp math | Statement | B | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 912 | AB Tree | dp greedy trees | Statement | F | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 3000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 757 | String Counting | combinatorics dp math | Statement | G | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 17715 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 22185 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 4929 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 38258 | Double-ended Strings | brute force dp hashing strings | Statement | C | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 608 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 33701 | The Cake Is a Lie | dp math | Statement | B | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 18040 | Unstable String | dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 16430 | Diluc and Kaeya | dp hashing number theory | Statement | C | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 1500.0 | Codeforces Round #724 — Editorial | 1500 |
| 17090 | 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 | |
| 27009 | Love Song | dp implementation strings | Statement | B | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 750.0 | tutorial | 800 |
| 1971 | Stringforces | binary search bitmasks data structures dp greedy strings two pointers | Statement | E | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 973 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 15616 | Reverse String | brute force dp hashing strings | Statement | B | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 16176 | Say No to Palindromes | brute force dp strings | Statement | D | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1600 | |
| 1664 | Rescue Niwen! | dp string suffix structures strings | Statement | E | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 520 | Palindromic Hamiltonian Path | brute force dp graphs | Statement | F | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 376 | Fix the String | *special bitmasks dp greedy | Statement | E | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 11784 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 1191 | 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 |
| 7366 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1218 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 4693 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 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) | |
| 7158 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 22346 | Get an Even String | dp greedy strings | Statement | C | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 3361 | Preorder | combinatorics divide and conquer dp dsu hashing trees | Statement | E | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 1460 | Typical Party in Dorm | bitmasks brute force combinatorics dp strings two pointers | Statement | E | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 2250.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 15988 | 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 | ||
| 1423 | 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 | ||
| 730 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 10538 | Color with Occurrences | dp greedy strings | Statement | D | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 6813 | Xor-Subsequence (easy version) | bitmasks brute force dp strings trees | Statement | D1 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2298 | Xor-Subsequence (hard version) | bitmasks data structures dp strings trees | Statement | D2 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 8422 | Letter Picking | constructive algorithms dp games | Statement | D | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 2613 | Cut Substrings | combinatorics dp hashing strings two pointers | Statement | G | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 4851 | Zero-One (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15217 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1030 | 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 | |
| 583 | 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> | |
| 684 | Keyboard Design | bitmasks data structures dp string suffix structures strings | Statement | F | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 446 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 1716 | 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 | |
| 1296 | Majority | dp strings | Statement | F | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 1473 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 3599 | Flexible String Revisit | combinatorics dp math probabilities | Statement | D | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 22847 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 29947 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 7455 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 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 |
| 1791 | Palindrome Partition | binary search brute force data structures dp hashing strings | Statement | C | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2600 |
| 35375 | Gold Rush | brute force dfs and similar dp implementation | Statement | D | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1000 | |
| 9278 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 175 | 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 | |
| 2261 | 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 | ||
| 6514 | 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 | ||
| 17205 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 6127 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 23818 | Not a Substring | constructive algorithms dp strings | Statement | A | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 2817 | 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 | |
| 13325 | 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 | ||
| 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 | |
| 35823 | Unnatural Language Processing | dp greedy implementation strings | Statement | D | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 39724 | Erase First or Second Letter | brute force combinatorics dp strings | Statement | B | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 3525 | 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) | |
| 20142 | Monsters Attack! | dp greedy implementation | Statement | B | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 17117 | 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 | |
| 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 | |
| 17654 | 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. | |
| 4937 | 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 | |
| 3146 | Sum over all Substrings (Hard Version) | dp greedy strings | Statement | D2 | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 40035 | Rudolf and the Ugly String | dp strings | Statement | C | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 12943 | Tandem Repeats? | brute force dp strings two pointers | Statement | D | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 6436 | Shuffling Songs | bitmasks dp graphs implementation strings | Statement | G | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 26853 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 466 | Unique Strings | combinatorics dp math | Statement | F | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 5487 | Division + LCP (easy version) | binary search data structures dp hashing string suffix structures strings | Statement | G1 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1900 | |
| 2676 | 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 | |
| 31180 | Binary Cut | dp greedy implementation sortings strings | Statement | D | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1100 | |
| 4715 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 23698 | Substring and Subsequence | bitmasks brute force dp graphs greedy hashing strings trees | Statement | B | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 24660 | Test of Love | dp greedy implementation | Statement | D | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 1705 | Minecraft | bitmasks brute force dp math | Statement | G | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2750.0 | Video Tutorial | |
| 3070 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 8886 | Lazy Narek | dp implementation | Statement | C | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 14069 | Alternating String | brute force data structures dp greedy strings | Statement | E | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 563 | Alice's Adventures in Addition | bitmasks dp implementation | Statement | F | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 830 | Missing Separators | dp sortings string suffix structures strings | Statement | H | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 2200 | |
| 25832 | Uninteresting Number | brute force dp math | Statement | C | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 15163 | Three Strings | dp implementation strings | Statement | E | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 1346 | Bugged Sort | dp greedy sortings | Statement | G | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 2319 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 2058 | Bro Thinks He's Him | combinatorics data structures dp matrices | Statement | H | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 8672 | Even String | combinatorics dp math strings | Statement | D | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 11069 | Median Splits | dp greedy | Statement | C | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 1500.0 | 142149 | |
| 8414 | Unpleasant Strings | binary search data structures dp greedy strings | Statement | E | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 754 | Numbers and Strings | brute force dfs and similar dp implementation math | Statement | F | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 4605 | Goblin | dp dsu greedy math | Statement | F | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 1881 | Binary String Wowee | combinatorics dp strings | Statement | E | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 2500.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 2104 | Build an Array | bitmasks dp math number theory | Statement | G | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 2249 | Interactive RBS (Hard Version) | binary search bitmasks constructive algorithms dp interactive | Statement | C3 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 1307 | Beyond the Palindrome (Easy Version) | combinatorics dp math | Statement | E1 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 3000.0 | Codeforces Round 1046 (Div. 1, 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 |