Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 5 6 7 ... 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 9076 | Sasha and a Bit of Relax | dp implementation | Statement | A | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 1600 | |
| 1507 | 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 | |
| 4006 | Jongmah | dp | Statement | D | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2200 | |
| 435 | Modest Substrings | dp strings | Statement | H | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3500 | |
| 1160 | Destroy the Colony | combinatorics dp math | Statement | D | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 2500 | |
| 1121 | Tree | data structures dfs and similar dp graphs trees | Statement | E | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 2800 | |
| 18370 | Sasha and His Trip | dp greedy math | Statement | A | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 900 | |
| 8045 | Flood Fill | dp | Statement | D | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 1900 | |
| 5281 | Magic Gems | dp math matrices | Statement | D | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2000 | |
| 675 | Crisp String | bitmasks dp | Statement | F | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2600 | |
| 651 | Tree Cutting (Hard Version) | combinatorics dfs and similar dp trees | Statement | F2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2700 | |
| 5572 | Pavel and Triangles | brute force dp fft greedy ternary search | Statement | E | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1900 | |
| 876 | Niyaz and Small Degrees | data structures dp trees | Statement | F | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 2900 | |
| 2458 | Compress String | dp strings | Statement | C | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2200 | |
| 1782 | Power Tree | dfs and similar dp dsu graphs greedy trees | Statement | D | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2400 | |
| 330 | Secret Letters | data structures dp greedy | Statement | F | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2900 | |
| 1005 | 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 | |
| 1321 | Isolation | data structures dp | Statement | D | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2800 | |
| 572 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 9476 | Connect | brute force dfs and similar dsu | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1400 | |
| 3647 | Gourmet choice | dfs and similar dp dsu graphs greedy | Statement | D | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2000 | |
| 1264 | String Multiplication | dp greedy strings | Statement | E | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2200 | |
| 540 | Most Dangerous Shark | data structures dp two pointers | Statement | G | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2900 | |
| 10875 | Clear the String | dp | Statement | F | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2000 | |
| 1978 | Knapsack | dfs and similar dp greedy | Statement | E | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2400 | |
| 1239 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 19790 | Middle of the Contest | implementation | Statement | A | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1000 | |
| 6497 | K Balanced Teams | dp sortings two pointers | Statement | E | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2000 | |
| 1326 | Museums Tour | dp graphs implementation | Statement | C | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 527 | Matches Are Not a Child's Play | data structures trees | Statement | F | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 3300 | |
| 16881 | Edgy Trees | dfs and similar dsu graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 2712 | Steps to One | dp math number theory probabilities | Statement | D | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2300 | |
| 13231 | Minimum Triangulation | dp greedy math | Statement | D | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 2117 | Palindrome-less Arrays | combinatorics divide and conquer dp | Statement | E | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2200 | |
| 3831 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 619 | Foreigner | dp | Statement | D | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2700 | |
| 2342 | Two Merged Sequences | dp greedy | Statement | G | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 2600 | |
| 1341 | Leaf Partition | dp trees | Statement | F | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 1056 | Zoning Restrictions | dp flows graphs | Statement | G | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2600 | |
| 684 | Satanic Panic | dp geometry | Statement | H | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2800 | |
| 3115 | Chladni Figure | brute force strings | Statement | B | Forethought Future Cup - Final Round (Onsite Finalists Only) {1147} | PROGRAMMING | Forethought Future Cup Final Round Tutorial | 1900 | |
| 2049 | Three Religions | dp implementation strings | Statement | B | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2200 | |
| 970 | Abandoning Roads | brute force dp graphs greedy | Statement | D | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 12923 | Dima and a Bad XOR | bitmasks brute force constructive algorithms dp | Statement | B | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1600 | |
| 3790 | Number of Components | combinatorics data structures dp math | Statement | E | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 2100 | |
| 1464 | Sonya and Informatics | combinatorics dp matrices probabilities | Statement | F | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 2500 | |
| 2582 | Neko and Aki's Prank | dp greedy trees | Statement | D | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2000 | |
| 756 | Neko Rules the Catniverse (Small Version) | bitmasks dp matrices | Statement | F1 | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2900 | |
| 925 | Neko Rules the Catniverse (Large Version) | bitmasks dp matrices | Statement | F2 | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2900 | |
| 5571 | Serval and Rooted Tree | binary search dfs and similar dp greedy trees | Statement | D | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1800 | |
| 933 | Serval and Bonus Problem | combinatorics dp math probabilities | Statement | F | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 2800 | |
| 3353 | Shovels Shop | dp greedy sortings | Statement | F | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 2300 | |
| 7767 | Beautiful Array | brute force data structures divide and conquer dp greedy | Statement | D | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1900 | |
| 517 | Delivery Oligopoly | brute force dp graphs | Statement | F | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 2700 | |
| 4689 | 0-1-Tree | dfs and similar divide and conquer dp dsu trees | Statement | D | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2300 | |
| 1723 | Card Bag | dp math probabilities | Statement | F | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2500 | |
| 2890 | Maximum Balanced Circle | constructive algorithms dp greedy two pointers | Statement | F | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2300 | |
| 504 | Density of subarrays | dp math | Statement | F | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 3400 | |
| 1565 | Mysterious Code | dp strings | Statement | D | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2200 | |
| 11089 | A Tale of Two Lands | binary search sortings two pointers | Statement | C | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 1600 | |
| 2738 | And Reachability | bitmasks dp | Statement | C | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2400 | |
| 441 | Anagram Paths | dp implementation trees | Statement | D | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2900 | |
| 47 | Good Subsets | *special dp | Statement | I | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 4426 | Nauuo and Circle | combinatorics dfs and similar dp trees | Statement | B | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2000 | |
| 1231 | Nauuo and Pictures (easy version) | dp probabilities | Statement | C1 | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2500 | |
| 1001 | Nauuo and Pictures (hard version) | dp probabilities | Statement | C2 | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2700 | |
| 1785 | 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 | |
| 4576 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 | |
| 714 | Yet Another Partiton Problem | data structures divide and conquer dp geometry two pointers | Statement | G | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2700 | |
| 15133 | Lose it! | dp greedy implementation | Statement | C | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1300 | |
| 2327 | Destroy it! | dp implementation sortings | Statement | F | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 2500 | |
| 22051 | WOW Factor | dp strings | Statement | B | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 2292 | Short Colorful Strip | combinatorics dfs and similar dp | Statement | F1 | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2200 | |
| 1052 | Long Colorful Strip | dp | Statement | F2 | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2600 | |
| 1037 | Fedor Runs for President | data structures dp trees | Statement | D | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2600 | |
| 27515 | Alex and a Rhombus | dp implementation math | Statement | A | Codeforces Round 569 (Div. 2) {1180} | PROGRAMMING | Editorial of Round #569 | 800 | |
| 3406 | Flag | brute force combinatorics dp implementation | Statement | C | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1900 | |
| 35766 | Filling Shapes | dp math | Statement | A | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1000 | |
| 3379 | Product Oriented Recurrence | dp math matrices number theory | Statement | E | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2200 | |
| 1019 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 5445 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 3660 | Subsequences (hard version) | dp strings | Statement | H | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2200 | |
| 3212 | Playlist for Polycarp (easy version) | bitmasks combinatorics dp | Statement | G1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2100 | |
| 932 | Playlist for Polycarp (hard version) | combinatorics dp | Statement | G2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2800 | |
| 11444 | Tree Painting | dfs and similar dp trees | Statement | E | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2000 | |
| 1124 | Expected Square Beauty | dp math probabilities | Statement | F | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2600 | |
| 2142 | Array Beauty | dp | Statement | C | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2700 | |
| 910 | Make Equal | dp | Statement | D | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 3000 | |
| 11084 | Candies! | data structures dp implementation math | Statement | C | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 1400 | |
| 367 | Cubeword | *special brute force dp meet-in-the-middle | Statement | C | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 510 | Magic Tree | *special data structures dp trees | Statement | B | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 468 | Amusement Park | *special dp math | Statement | A | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 2066 | Count The Rectangles | bitmasks brute force data structures geometry sortings | Statement | E | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2200 | |
| 1223 | 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 | |
| 334 | Another Meme Problem | dp | Statement | G | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 3000 | |
| 35421 | Basketball Exercise | dp | Statement | C | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1400 | |
| 10479 | RGB Substring (hard version) | data structures dp implementation two pointers | Statement | D2 | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1600 | |
| 5806 | Yet Another Subarray Problem | dp greedy math | Statement | D | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1900 | |
| 1860 | Culture Code | binary search combinatorics data structures dp shortest paths sortings | Statement | E | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2300 | |
| 343 | Coloring Game | dp games matrices | Statement | F | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2500 | |
| 4076 | Matching vs Independent Set | constructive algorithms graphs greedy sortings | Statement | C | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2200 | |
| 3756 | Rectangle Painting 1 | dp | Statement | D | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2400 | |
| 22459 | Water Lily | geometry math | Statement | B | Codeforces Round 576 (Div. 2) {1199} | PROGRAMMING | E | 1000 | |
| 14689 | Block Adventure | dp greedy | Statement | B | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1300 | |
| 4404 | White Lines | brute force data structures dp implementation two pointers | Statement | D | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1900 | |
| 1164 | 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 | |
| 2538 | Treasure Hunting | binary search dp greedy implementation | Statement | D | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2000 | |
| 4851 | You Are Given a Decimal String... | brute force dp shortest paths | Statement | B | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1700 | |
| 2773 | 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 | |
| 3326 | Complete the Projects (hard version) | dp greedy | Statement | F2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2400 | |
| 7264 | Anna, Svyatoslav and Maps | dp graphs greedy shortest paths | Statement | C | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1700 | |
| 2085 | Natasha, Sasha and the Prefix Sums | combinatorics dp math number theory | Statement | E | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2400 | |
| 29588 | Make Product Equal One | dp implementation | Statement | B | Codeforces Round 580 (Div. 2) {1206} | PROGRAMMING | Editorial of Codeforces Round #580 | 900 | |
| 10504 | Gas Pipeline | dp greedy | Statement | C | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1500 | |
| 3324 | Bits And Pieces | bitmasks dfs and similar dp greedy | Statement | F | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2600 | |
| 3260 | Rotate Columns (easy version) | bitmasks brute force dp greedy sortings | Statement | E1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 2313 | Rotate Columns (hard version) | bitmasks dp greedy sortings | Statement | E2 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2400 | |
| 231 | Moving Walkways | data structures greedy math | Statement | H | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 3300 | |
| 5550 | Anadi and Domino | brute force graphs | Statement | A | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1600 | |
| 310 | Mateusz and Escape Room | dp | Statement | G | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 3400 | |
| 57 | Road Repair in Treeland | *special binary search dp trees | Statement | H | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 7173 | 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 | |
| 2866 | Petya and Construction Set | constructive algorithms graphs math sortings trees | Statement | E | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2000 | |
| 18664 | The Number of Products | combinatorics dp implementation | Statement | B | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 3469 | Marbles | bitmasks dp | Statement | E | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 2200 | |
| 3117 | Wi-Fi | data structures dp greedy | Statement | F | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 220 | Jumping Transformers | dp | Statement | C | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2800 | |
| 180 | BubbleReactor | dp graphs | Statement | A | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2800 | |
| 3012 | Tourism | dfs and similar dp dsu graphs greedy trees | Statement | E | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2200 | |
| 10229 | Make The Fence Great Again | dp | Statement | D | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1700 | |
| 882 | Graph And Numbers | bitmasks brute force combinatorics dp meet-in-the-middle | Statement | G | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2900 | |
| 4475 | Sequence Sorting | dp greedy two pointers | Statement | D | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2000 | |
| 2902 | Paint the Tree | dp sortings trees | Statement | E | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2200 | |
| 2270 | Stack Exterminable Arrays | data structures divide and conquer dp hashing | Statement | F | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2600 | |
| 2106 | Rock Is Push | binary search dp | Statement | E | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2200 | |
| 661 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 2065 | Wrong Answer on test 233 (Easy Version) | dp | Statement | F1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2100 | |
| 3494 | Another Filling the Grid | combinatorics dp math | Statement | E | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 2300 | |
| 13518 | Pipes | dp implementation | Statement | C | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1400 | |
| 2985 | Yet Another Substring Reverse | bitmasks dp | Statement | F | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 2400 | |
| 735 | Alice and the Unfair Game | binary search data structures dp dsu | Statement | E | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2600 | |
| 1523 | Balanced Binary Search Trees | dp math | Statement | E | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2400 | |
| 1103 | Balanced Domino Placements | combinatorics dp | Statement | F | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2600 | |
| 166 | Balanced Distribution | data structures dp greedy | Statement | G | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3600 | |
| 7865 | Standard Free2play | dp greedy math | Statement | C | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1600 | |
| 6448 | 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 | |
| 3486 | Keyboard Purchase | bitmasks dp | Statement | E | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2200 | |
| 2078 | The Maximum Subtree | dfs and similar dp graphs trees | Statement | F | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2300 | |
| 7797 | 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 | |
| 1169 | Turtle | dp implementation | Statement | E | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 3100 | |
| 9397 | 0-1 MST | dfs and similar dsu graphs sortings | Statement | B | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1900 | |
| 1956 | Sum Balance | bitmasks dfs and similar dp graphs | Statement | C | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 2400 | |
| 8321 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 14552 | Restricted RPS | constructive algorithms dp greedy | Statement | B | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1200 | |
| 20026 | Constanze's Machine | dp | Statement | C | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1400 | |
| 2273 | Daniel and Spring Cleaning | bitmasks brute force combinatorics dp | Statement | F | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 1371 | Hyakugoku and Ladders | dp probabilities shortest paths | Statement | E | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 2525 | The World Is Just a Programming Task (Easy Version) | brute force dp greedy implementation | Statement | D1 | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1900 | |
| 11102 | By Elevator or Stairs? | dp shortest paths | Statement | E | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1700 | |
| 5521 | Too Many Segments (easy version) | greedy | Statement | D1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1900 | |
| 5795 | Too Many Segments (hard version) | data structures greedy sortings | Statement | D2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2000 | |
| 2758 | Maximum Weight Subset | dp trees | Statement | F | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2500 | |
| 779 | Discarding Game | dp greedy two pointers | Statement | G | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2400 | ||
| 216 | Conference Problem | dp | Statement | D | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 2597 | Voting (Easy Version) | data structures dp greedy | Statement | E1 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2200 | |
| 786 | Tiling Terrace | brute force dp | Statement | J | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 588 | Cleaning Robots | dp trees | Statement | B | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 415 | 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 | |
| 15396 | Sweets Eating | dp greedy math sortings | Statement | C | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1500 | |
| 3073 | Antenna Coverage | data structures dp greedy sortings | Statement | E | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2200 | |
| 4614 | Yet Another Division Into Teams | dp greedy sortings | Statement | E | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 8188 | Yet Another Monster Killing Problem | binary search data structures dp greedy sortings two pointers | Statement | D | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1700 | |
| 4576 | The Contest | data structures dp greedy | Statement | E | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2000 | |
| 4201 | A Game with Traps | binary search dp greedy sortings | Statement | D | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1900 | |
| 1891 | Tournament | brute force dp greedy | Statement | E | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2400 | |
| 957 | Economic Difficulties | data structures dfs and similar dp flows graphs trees | Statement | F | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2500 | |
| 1542 | Beautiful Bracket Sequence (easy version) | combinatorics dp probabilities | Statement | D1 | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2600 | |
| 4563 | Beautiful Mirrors | data structures dp math probabilities | Statement | E | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 2100 | |
| 134 | Red-Blue Graph | dp graphs math matrices meet-in-the-middle | Statement | H | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 3400 | |
| 6460 | Domino for Young | dp greedy math | Statement | B | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2000 | |
| 296 | Happy Cactus | dp | Statement | E | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 3400 | |
| 3718 | Common Number | binary search combinatorics dp math | Statement | E | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 3416 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 30911 | Yet Another Broken Keyboard | combinatorics dp implementation | Statement | C | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1100 | |
| 14703 | Snow Walking Robot | constructive algorithms greedy implementation | Statement | B | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1200 | |
| 19403 | Remove One Element | brute force dp | Statement | D | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1500 | |
| 2342 | Two Bracket Sequences | dp strings two pointers | Statement | F | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 2400 | |
| 12964 | As Simple as One and Two | dp greedy | Statement | A | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1300 | |
| 676 | Tree Elimination | dp trees | Statement | D | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2600 | |
| 8581 | Berry Jam | data structures dp greedy implementation | Statement | C | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1600 | |
| 4349 | Segment Tree | data structures dsu graphs trees | Statement | D | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2100 | |
| 2049 | Tests for problem D | constructive algorithms dfs and similar divide and conquer trees | Statement | E | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2200 | |
| 2529 | 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 | |
| 456 | New Year Permutations | combinatorics dp | Statement | E | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 2700 | |
| 1227 | New Year and Handle Change | binary search dp | Statement | F | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 2800 | |
| 1244 | Miss Punyverse | dp greedy trees | Statement | D | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2700 | |
| 231 | Kirchhoff's Current Loss | math | Statement | E | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2900 | |
| 12180 | K for the Price of One (Easy Version) | dp greedy sortings | Statement | B1 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1400 | |
| 11035 | K for the Price of One (Hard Version) | dp greedy sortings | Statement | B2 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1600 | |
| 7349 | New Year Parties | dp greedy | Statement | E | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 11486 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 31242 | Just Eat It! | dp greedy implementation | Statement | B | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1300 | |
| 8643 | 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 | |
| 2005 | Delete a Segment | brute force constructive algorithms data structures dp graphs sortings trees two pointers | Statement | E | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2300 | |
| 9669 | Garland | dp greedy sortings | Statement | A | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 1700 | |
| 298 | Harry The Potter | brute force constructive algorithms dp fft implementation math | Statement | F | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 3200 | |
| 15475 | Two Arrays | combinatorics dp | Statement | C | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1600 | |
| 593 | Making Shapes | dp | Statement | F | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 3250.0 | Codeforces Round #616 Editorial | 3500 |
| 2255 | Xenon's Attack on the Gangs | combinatorics dfs and similar dp greedy trees | Statement | C | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1250.0 | Codeforces Round #614 Editorial | 2300 |
| 977 | 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 |
| 372 | Nora's Toy Boxes | bitmasks combinatorics dp | Statement | F | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2750.0 | Codeforces Round #614 Editorial | 3400 |
| 6940 | Three Paths on a Tree | dfs and similar dp greedy trees | Statement | F | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 2100 | |
| 13869 | Obtain The String | dp greedy strings | Statement | C | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1600 | |
| 1511 | Good Contest | combinatorics dp probabilities | Statement | F | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 2600 | |
| 15754 | Yet Another Walking Robot | data structures implementation | Statement | C | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1500 | |
| 8228 | String Coloring (easy version) | constructive algorithms dp graphs greedy sortings | Statement | E1 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1800 | |
| 5465 | String Coloring (hard version) | data structures dp | Statement | E2 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2100 | |
| 78 | M-numbers | *special dp math | Statement | G | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 53 | Paint the String | *special dp strings | Statement | H | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 530 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 1620 | Nanosoft | binary search data structures dp implementation | Statement | E | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2500 |
| 20142 | Three Strings | implementation strings | Statement | A | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 500.0 | Codeforces Round #619 (Div. 2) Editorial | 800 |
| 3215 | Erase Subsequences | brute force dp greedy strings | Statement | E | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2200 | |
| 17806 | Air Conditioner | dp greedy implementation sortings two pointers | Statement | C | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1500.0 | Codeforces Round #620 (Div. 2) Editorial | 1500 |
| 2003 | Animal Observation (easy version) | data structures dp | Statement | F1 | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2400 |
| 1819 | Animal Observation (hard version) | data structures dp greedy | Statement | F2 | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1000.0 | Codeforces Round #620 (Div. 2) Editorial | 2600 |
| 1398 | Kuroni and Antihype | bitmasks dp dsu graphs | Statement | G | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 3250.0 | Ozon Tech Challenge 2020 Editorial | 3300 |
| 13871 | Cow and Friend | geometry greedy math | Statement | B | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1300 |
| 12691 | 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 |
| 1367 | Cow and Treats | binary search combinatorics dp greedy implementation math | Statement | E | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 2400 |
| 2059 | Tourism | brute force dp graphs probabilities | Statement | D | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2300 |
| 579 | Double Elimination | dp implementation | Statement | B | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2500 |
| 730 | 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 |
| 404 | Strange Function | dp | Statement | E | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2900 |
| 1083 | Autocompletion | data structures dfs and similar dp | Statement | G | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 7521 | Array Shrinking | dp | Statement | E | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 11081 | Skyscrapers (easy version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1500 |
| 7333 | Skyscrapers (hard version) | data structures dp greedy | Statement | C2 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1900 |
| 1525 | Happy New Year | bitmasks dp implementation | Statement | D | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 2000.0 | Editorial | 2600 |
| 9638 | 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 |
| 5444 | Team Building | bitmasks dp greedy sortings | Statement | E | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2250.0 | Codecraft-20 (Div.2) Editorial | 2300 |
| 894 | Reality Show | bitmasks dp | Statement | D | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 2000.0 | Codeforces Round #626 Editorial | |
| 163 | Assigning Fares | dp dp dp trees | Statement | F | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 3000.0 | Codeforces Round #626 Editorial | |
| 20938 | Even Subset Sum Problem | brute force dp greedy implementation | Statement | A | Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics) {1323} | PROGRAMMING | 500.0 | Codeforces Round #626 Editorial | |
| 13226 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 17194 | Sleeping Schedule | dp | Statement | E | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 1009 | Wise Men (Easy Version) | bitmasks brute force dp meet-in-the-middle | Statement | F1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 2000.0 | 74961 | 2600 |
| 686 | Wise Men (Hard Version) | bitmasks dp math | Statement | F2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1500.0 | 74961 | 3200 |
| 108 | Spiderweb Trees | dp geometry trees | Statement | G | Codeforces Global Round 7 {1326} | PROGRAMMING | 4000.0 | 74961 | 3600 |
| 9731 | Count The Blocks | combinatorics dp math | Statement | E | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1800 |