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 ... 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 13316 | The least round way | dp math | Statement | B | Codeforces Beta Round 2 {2} | PROGRAMMING | Codeforces Beta Round #2 - Tutorial | 2000 | |
| 12443 | Mysterious Present | dp sortings | Statement | D | Codeforces Beta Round 4 (Div. 2 Only) {4} | PROGRAMMING | 1800 | ||
| 18867 | 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 | |
| 2340 | Lizards and Basements 2 | brute force dp | Statement | D | Codeforces Beta Round 6 (Div. 2 Only) {6} | PROGRAMMING | Beta Round #6 - Разбор задач | 2100 | |
| 814 | Defining Macros | dp expression parsing implementation | Statement | E | Codeforces Beta Round 7 {7} | PROGRAMMING | 2500 | ||
| 4431 | Looking for Order | bitmasks dp | Statement | C | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 2000 | |
| 810 | Beads | dp graphs | Statement | E | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 2600 | |
| 4619 | How many trees? | combinatorics divide and conquer dp | Statement | D | Codeforces Beta Round 9 (Div. 2 Only) {9} | PROGRAMMING | Codeforces Beta Round #9 tutorial | 2000 | |
| 2113 | Cinema Cashier | dp implementation | Statement | B | Codeforces Beta Round 10 {10} | PROGRAMMING | 1600 | ||
| 5960 | LCIS | dp | Statement | D | Codeforces Beta Round 10 {10} | PROGRAMMING | 2700 | ||
| 6784 | A Simple Task | bitmasks dp graphs | Statement | D | Codeforces Beta Round 11 {11} | PROGRAMMING | 2200 | ||
| 498 | Forward, march! | binary search dp greedy | Statement | E | Codeforces Beta Round 11 {11} | PROGRAMMING | 2800 | ||
| 1172 | Letter A | geometry implementation | Statement | B | Codeforces Beta Round 13 {13} | PROGRAMMING | Codeforces Beta Round #13 editorial | 2000 | |
| 5645 | Sequence | dp sortings | Statement | C | Codeforces Beta Round 13 {13} | PROGRAMMING | Codeforces Beta Round #13 editorial | 2200 | |
| 772 | Triangles | dp geometry | Statement | D | Codeforces Beta Round 13 {13} | PROGRAMMING | Codeforces Beta Round #13 editorial | 2500 | |
| 2115 | Camels | dp | Statement | E | Codeforces Beta Round 14 (Div. 2) {14} | PROGRAMMING | Codeforces Beta Round #14 tutorial | 2000 | |
| 5416 | Two Paths | dfs and similar dp graphs shortest paths trees two pointers | Statement | D | Codeforces Beta Round 14 (Div. 2) {14} | PROGRAMMING | Codeforces Beta Round #14 tutorial | 2100 | |
| 694 | Triangles | combinatorics dp | Statement | E | Codeforces Beta Round 15 {15} | PROGRAMMING | Codeforces Beta #15 Tutorial (Incomplete) | 2600 | |
| 6819 | Fish | bitmasks dp probabilities | Statement | E | Codeforces Beta Round 16 (Div. 2 Only) {16} | PROGRAMMING | Codeforces Beta Round #16 Tutorial | 2100 | |
| 1076 | Balance | dp | Statement | C | Codeforces Beta Round 17 {17} | PROGRAMMING | Codeforces Beta Round #17 Tutorial | 2500 | |
| 1320 | Seller Bob | brute force dp greedy | Statement | D | Codeforces Beta Round 18 (Div. 2 Only) {18} | PROGRAMMING | Codeforces Beta Round #18(Div. 2) Tutorial | 2100 | |
| 1308 | Flag 2 | dp | Statement | E | Codeforces Beta Round 18 (Div. 2 Only) {18} | PROGRAMMING | Codeforces Beta Round #18(Div. 2) Tutorial | 2400 | |
| 6049 | Checkout Assistant | dp | Statement | B | Codeforces Beta Round 19 {19} | PROGRAMMING | Code Force Beta Round 19 Solution | 1900 | |
| 49756 | Dijkstra? | graphs shortest paths | Statement | C | Codeforces Alpha Round 20 (Codeforces format) {20} | PROGRAMMING | 2100 | ||
| 2622 | Stripe 2 | binary search dp sortings | Statement | C | Codeforces Alpha Round 21 (Codeforces format) {21} | PROGRAMMING | 2300 | ||
| 1382 | Traveling Graph | bitmasks graph matchings graphs | Statement | D | Codeforces Alpha Round 21 (Codeforces format) {21} | PROGRAMMING | 2500 | ||
| 4862 | Bargaining Table | brute force dp | Statement | B | Codeforces Beta Round 22 (Div. 2 Only) {22} | PROGRAMMING | Codeforces Beta Round #22 Tutorial | 1600 | |
| 3492 | Segments | greedy sortings | Statement | D | Codeforces Beta Round 22 (Div. 2 Only) {22} | PROGRAMMING | Codeforces Beta Round #22 Tutorial | 1900 | |
| 765 | Tree | dp | Statement | E | Codeforces Beta Round 23 {23} | PROGRAMMING | Codeforces Beta Round #23 tutorial | 2500 | |
| 2801 | Broken robot | dp probabilities | Statement | D | Codeforces Beta Round 24 {24} | PROGRAMMING | Codeforces Beta Round #24 solutions | 2400 | |
| 4991 | 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 | |
| 3170 | Ring Road 2 | 2-sat dfs and similar dsu graphs | Statement | D | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2300 | |
| 726 | Don't fear, DravDe is kind | binary search data structures dp hashing | Statement | D | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2600 | |
| 1352 | Bath Queue | combinatorics dp probabilities | Statement | C | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2700 | |
| 2455 | Shooting Gallery | dp probabilities | Statement | C | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Разбор C | 1800 | |
| 1255 | Chocolate | dfs and similar implementation | Statement | D | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 2000 | ||
| 1354 | TV Game | dp | Statement | E | Codeforces Beta Round 31 (Div. 2, Codeforces format) {31} | PROGRAMMING | 2200 | ||
| 3940 | Animals | dp greedy | Statement | D | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 1700 | ||
| 586 | Lesson Timetable | combinatorics dp math | Statement | D | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 2300 | |
| 3028 | Let's Go Rolling! | dp sortings | Statement | E | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи D) | 1800 | |
| 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 | |
| 490 | The Great Marathon | dp | Statement | H | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи C) | 2500 | |
| 1097 | What Has Dirichlet Got to Do with That? | dp games | Statement | E | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 2100 | |
| 720 | 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 | |
| 2957 | Pawn | dp | Statement | D | Codeforces Beta Round 40 (Div. 2) {41} | PROGRAMMING | Codeforces Beta Round #40 Mini-Tutorial | 2000 | |
| 6232 | Anfisa the Monkey | dp | Statement | E | School Team Contest 2 (Winter Computer School 2010/11) {44} | PROGRAMMING | School Team Contest #2 (Winter Computer School 2010/2011): tutorial of F, G and I. | 1500 | |
| 2034 | Phone Number | dp | Statement | H | School Team Contest 2 (Winter Computer School 2010/11) {44} | PROGRAMMING | School Team Contest #2 (Winter Computer School 2010/2011): tutorial of F, G and I. | 1800 | |
| 83 | BerPaint | geometry graphs | Statement | F | School Team Contest 2 (Winter Computer School 2010/11) {44} | PROGRAMMING | School Team Contest #2 (Winter Computer School 2010/2011): tutorial of A-E, H, J. | 2600 | |
| 343 | School | dp dsu | Statement | B | School Team Contest 3 (Winter Computer School 2010/11) {45} | PROGRAMMING | 2400 | ||
| 1170 | Comb | data structures dp | Statement | E | School Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules) {46} | PROGRAMMING | School Individual Contest #2 (WCS 2010/11) - Codeforces Beta Round #43 (ACM-ICPC Rules): A, C, F and G tutorial | 1900 | |
| 738 | Ivan the Fool VS Gorynych the Dragon | dp games graphs | Statement | E | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2100 | ||
| 365 | Galaxy Union | dp trees two pointers | Statement | G | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2600 | ||
| 2155 | Game | brute force dp implementation | Statement | D | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 1700 | ||
| 821 | Common ancestor | dp | Statement | E | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 2200 | ||
| 746 | Bombing | binary search dp probabilities | Statement | D | Codeforces Beta Round 47 {50} | PROGRAMMING | Codeforces #47 problem solutions | 2100 | |
| 860 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 1344 | Dead Ends | bitmasks dp | Statement | E | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Tutorial for problems of Codeforces Beta Round #49 (Div.2). All problems now. | 2500 | |
| 1733 | First Digit Law | dp math probabilities | Statement | C | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2000 | |
| 738 | Writing a Song | brute force dp strings | Statement | D | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2100 | |
| 4861 | Beautiful numbers | dp number theory | Statement | D | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 2400 | |
| 4075 | Spoilt Permutation | implementation | Statement | B | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1400 | |
| 2194 | Changing a String | dp | Statement | D | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 367 | Journey | dp math | Statement | D | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 2400 | |
| 480 | Expression | dp | Statement | E | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 2400 | |
| 340 | World Evil | dp flows | Statement | E | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2700 | |
| 895 | Sweets Game | bitmasks dfs and similar dp games implementation | Statement | E | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Разбор задач Codeforces Round #59 (Div. 2) | 2200 | |
| 955 | Petya and Post | data structures dp | Statement | E | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 2100 | |
| 2554 | Partial Teacher | dp graphs greedy implementation | Statement | A | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 1804 | Optical Experiment | binary search data structures dp | Statement | D | Manthan 2011 {67} | PROGRAMMING | 1900 | ||
| 788 | Sequence of Balls | dp | Statement | C | Manthan 2011 {67} | PROGRAMMING | 2500 | ||
| 540 | Half-decay tree | data structures divide and conquer dp math probabilities | Statement | D | Codeforces Beta Round 62 {68} | PROGRAMMING | 2400 | ||
| 1155 | Dot | dp games | Statement | D | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 2100 | |
| 621 | Information Reform | dp implementation trees | Statement | E | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2700 | |
| 7431 | Round Table Knights | dp math number theory | Statement | C | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 1600 | |
| 983 | Nuclear Fusion | bitmasks dp | Statement | E | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 2200 | |
| 2954 | Fibonacci army | *special dp | Statement | G | Unknown Language Round 2 {72} | PROGRAMMING | 1200 | ||
| 2516 | LionAge II | dp | Statement | C | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 1800 | |
| 1801 | Train | dp games greedy | Statement | B | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 1600 | |
| 2126 | Big Maximum Sum | data structures dp greedy implementation math trees | Statement | D | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2) Editorial | 2100 | |
| 2470 | Plus and xor | dp greedy math | Statement | D | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 1800 | |
| 858 | Tourist | binary search data structures dp | Statement | F | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2400 | |
| 389 | 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 | |
| 1253 | Beavermuncher-0xFF | dfs and similar dp dsu greedy trees | Statement | C | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 2300 | |
| 378 | Domino Carpet | dp implementation | Statement | D | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Problem analysis: Codeforces Beta Round #69 Falling Anvils (Div. 1 - Problem B , Div. 2 - Problem D) | 2300 | |
| 2229 | 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 | |
| 2147 | Beaver | data structures dp greedy hashing strings two pointers | Statement | C | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 Editorial | 1800 | |
| 1489 | Password | bitmasks dp shortest paths | Statement | D | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 2700 | |
| 460 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 911 | General Mobilization | data structures dfs and similar sortings | Statement | C | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1900 | |
| 2342 | Two out of Three | dp | Statement | D | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 2000 | |
| 272 | Corridor | geometry | Statement | E | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 2500 | |
| 1091 | Numbers | dp math number theory | Statement | D | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2400 | |
| 597 | Two Subsequences | bitmasks dp | Statement | E | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2800 | |
| 959 | Genetic engineering | dp string suffix structures trees | Statement | C | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2400 | |
| 1764 | Interesting Game | dp games math | Statement | C | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2100 | |
| 1100 | Beautiful Road | dfs and similar dp dsu graphs implementation sortings trees | Statement | D | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2300 | |
| 615 | Widget Library | dp expression parsing graphs implementation | Statement | B | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2200 | |
| 477 | Flags | dp math matrices | Statement | D | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2400 | |
| 555 | Lostborn | dp math number theory | Statement | E | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2600 | |
| 1415 | Lucky Numbers | dp greedy | Statement | B | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 1800 | |
| 2078 | Lucky Country | dp dsu graphs | Statement | E | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 2400 | |
| 557 | Horse Races | dp math | Statement | D | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 2500 | |
| 571 | Help Shrek and Donkey | dp games math probabilities | Statement | E | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | Editorial | 2500 | |
| 76 | Interval Coloring | *special greedy math | Statement | J | Unknown Language Round 3 {100} | PROGRAMMING | 2400 | ||
| 3234 | Buses | binary search data structures dp | Statement | B | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | Codeforces Beta Round 79, editoral | 1900 | |
| 813 | Castle | dp greedy probabilities sortings trees | Statement | D | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | Codeforces Beta Round 79, editoral | 2300 | |
| 659 | Candies and Stones | divide and conquer dp | Statement | E | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | Codeforces Beta Round 79, editoral | 2400 | |
| 7236 | Buns | dp | Statement | C | Codeforces Beta Round 82 (Div. 2) {106} | PROGRAMMING | Solutions for Codeforces Beta Round #82 (Div. 2) | 1600 | |
| 4390 | Basketball Team | combinatorics dp math probabilities | Statement | B | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 1700 | |
| 519 | Crime Management | dp graphs matrices | Statement | D | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 2400 | |
| 504 | Arrangement | bitmasks dp | Statement | C | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 2500 | |
| 4208 | Lucky Tree | dp dsu trees | Statement | C | Codeforces Beta Round 84 (Div. 1 Only) {109} | PROGRAMMING | Tutorial | 2000 | |
| 1625 | Petya and Spiders | bitmasks dp dsu | Statement | C | Codeforces Beta Round 85 (Div. 1 Only) {111} | PROGRAMMING | Codeforces Beta Round #85: Разбор задач | 2100 | |
| 939 | Petya and Coloring | combinatorics dp | Statement | D | Codeforces Beta Round 85 (Div. 1 Only) {111} | PROGRAMMING | Codeforces Beta Round #85: Разбор задач | 2300 | |
| 2443 | Linear Kingdom Races | data structures dp | Statement | E | Codeforces Beta Round 87 (Div. 1 Only) {115} | PROGRAMMING | Tutorial | 2400 | |
| 489 | Unambiguous Arithmetic Expression | dp expression parsing | Statement | D | Codeforces Beta Round 87 (Div. 1 Only) {115} | PROGRAMMING | Tutorial | 2600 | |
| 21199 | Caesar's Legions | dp | Statement | D | Codeforces Beta Round 89 (Div. 2) {118} | PROGRAMMING | Разбор задач. Codeforces beta round #89. | 1800 | |
| 1133 | Education Reform | dp | Statement | C | Codeforces Beta Round 90 {119} | PROGRAMMING | Разбор задачи E Codeforces Beta Round #90 | 2000 | |
| 4179 | Spiders | dp greedy trees | Statement | F | School Regional Team Contest, Saratov, 2011 {120} | PROGRAMMING | Tutorial for school regional team contest of Saratov | 1500 | |
| 758 | Brackets | combinatorics dp greedy | Statement | C | Codeforces Beta Round 92 (Div. 1 Only) {123} | PROGRAMMING | Codeforces Beta Round #92 - Analysis | 2300 | |
| 843 | Maze | dfs and similar dp probabilities trees | Statement | E | Codeforces Beta Round 92 (Div. 1 Only) {123} | PROGRAMMING | Codeforces Beta Round #92 - Analysis | 2600 | |
| 26159 | Password | binary search dp hashing string suffix structures strings | Statement | B | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 1800 | |
| 982 | Fibonacci Sums | dp math | Statement | D | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 2200 | |
| 12835 | Wasted Time | geometry | Statement | A | Codeforces Beta Round 93 (Div. 2 Only) {127} | PROGRAMMING | Editorial for Codeforces Beta Round #93 | 1000 | |
| 3325 | Games with Rectangle | combinatorics dp | Statement | C | Codeforces Beta Round 94 (Div. 1 Only) {128} | PROGRAMMING | 3219 | 2100 | |
| 2674 | Logo Turtle | dp | Statement | C | Codeforces Beta Round 96 (Div. 1) {132} | PROGRAMMING | Codeforces Beta Round #96: editorial | 1900 | |
| 834 | Piet | implementation | Statement | B | Codeforces Beta Round 96 (Div. 1) {132} | PROGRAMMING | Codeforces Beta Round #96: editorial | 2000 | |
| 745 | Constants in the language of Shakespeare | constructive algorithms dp greedy | Statement | D | Codeforces Beta Round 96 (Div. 1) {132} | PROGRAMMING | Codeforces Beta Round #96: editorial | 2100 | |
| 1734 | Palindromes | dp strings | Statement | D | Codeforces Beta Round 98 (Div. 2) {137} | PROGRAMMING | Codeforces Beta Round #98 (Div. 2): Editorial | 1900 | |
| 626 | World of Darkraft | dp games | Statement | D | Codeforces Beta Round 99 (Div. 1) {138} | PROGRAMMING | Codeforces Beta Round #99: editorial | 2500 | |
| 232 | Hellish Constraints | brute force dp two pointers | Statement | E | Codeforces Beta Round 99 (Div. 1) {138} | PROGRAMMING | Codeforces Beta Round #99: editorial | 2900 | |
| 1103 | New Year Garland | combinatorics dp | Statement | E | Codeforces Round 100 {140} | PROGRAMMING | Codeforces Round #100: problem analysis | 2600 | |
| 1403 | Clearing Up | constructive algorithms dp dsu graphs | Statement | E | Codeforces Round 101 (Div. 2) {141} | PROGRAMMING | Codeforces Round #101 (Div. 2) Разбор Задач. | 2600 | |
| 1016 | Help Caretaker | brute force dp | Statement | C | Codeforces Round 102 (Div. 1) {142} | PROGRAMMING | Codeforces Round #102 — Editorial | 2300 | |
| 2215 | Lucky Subsequence | combinatorics dp math | Statement | C | Codeforces Round 104 (Div. 1) {145} | PROGRAMMING | Codeforces Round #104 - Editorial | 2200 | |
| 9380 | Bag of mice | dp games math probabilities | Statement | D | Codeforces Round 105 (Div. 2) {148} | PROGRAMMING | Codeforces Round #105 (Div. 2): editorial | 1900 | |
| 4982 | Porcelain | dp | Statement | E | Codeforces Round 105 (Div. 2) {148} | PROGRAMMING | Codeforces Round #105 (Div. 2): editorial | 2000 | |
| 4798 | Coloring Brackets | dp | Statement | D | Codeforces Round 106 (Div. 2) {149} | PROGRAMMING | Editorial Round #106 | 2200 | |
| 783 | Mission Impassable | dp strings | Statement | D | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 2600 | |
| 611 | Garden | bitmasks dp graphs trees | Statement | E | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | Разбор задач Codeforces Round #108 (Div. 2) | 2400 | |
| 2694 | Cipher | combinatorics dp | Statement | C | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | Codeforces Round 110 — Разбор задач | 2100 | |
| 246 | Mrs. Hudson's Pancakes | brute force dp | Statement | E | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | Codeforces Round 110 — Разбор задач | 2900 | |
| 1546 | Phone Talks | *special dp sortings | Statement | E | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2300 | |
| 4738 | 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 | |
| 20145 | Distance in Tree | dfs and similar dp trees | Statement | D | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1800 | |
| 543 | Polycarpus the Safecracker | brute force dp | Statement | E | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 2400 | |
| 3038 | Substring and Subsequence | dp | Statement | A | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 1900 | |
| 2322 | 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 | |
| 14061 | 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 | |
| 9970 | Compatible Numbers | bitmasks brute force dfs and similar dp | Statement | E | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2100 | |
| 26328 | Tetrahedron | dp math matrices | Statement | E | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1500 | |
| 418 | Shoe Store | dp graph matchings greedy sortings two pointers | Statement | D | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 2400 | |
| 2541 | Wizards and Huge Prize | dp math probabilities | Statement | B | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2000 | |
| 1120 | Spiral Maximum | brute force dp | Statement | C | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1800 | |
| 2545 | File List | dp greedy implementation | Statement | B | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1500 | |
| 332 | Plane of Tanks: Duel | brute force dp math probabilities | Statement | D | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 2400 | |
| 305 | Power Defence | brute force dp geometry greedy | Statement | E | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 2500 | |
| 2438 | Word Cut | dp | Statement | B | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1900 | |
| 416 | Hyper String | dp | Statement | D | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 2500 | |
| 392 | Representative Sampling | dp sortings strings | Statement | F2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2400 | |
| 8698 | Letter | dp | Statement | C | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1400 | ||
| 2096 | Cubes | binary search dp two pointers | Statement | E | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1700 | ||
| 1694 | Wooden Fence | dp | Statement | E | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1800 | |
| 520 | T-shirt | dp greedy probabilities | Statement | D | Croc Champ 2012 - Final {183} | PROGRAMMING | CROC Champ 2012 — Round 3 (Editorial) | 2800 | |
| 151 | Clever Fat Rat | dp | Statement | C | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2300 | |
| 2384 | AlgoRace | dp shortest paths | Statement | B | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 1900 | |
| 83703 | Cut Ribbon | brute force dp | Statement | A | Codeforces Round 119 (Div. 2) {189} | PROGRAMMING | Codeforces Round #119 — Editorial | 1300 | |
| 4636 | Dynasty Puzzles | dp | Statement | A | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 1600 | |
| 3263 | Clear Symmetry | constructive algorithms dp math | Statement | A | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | Разбор задач | 1700 | |
| 1557 | Fragile Bridges | dp | Statement | C | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2200 | ||
| 493 | Brand New Problem | bitmasks brute force dp | Statement | D | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2500 | ||
| 6763 | Little Elephant and Interval | binary search combinatorics dp | Statement | A | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 673 | Little Elephant and Retro Strings | dp | Statement | D | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2400 | |
| 1526 | Solitaire | dfs and similar dp | Statement | B | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1800 | |
| 2187 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1900 | |
| 2912 | Multicolored Marbles | dp math | Statement | A | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 1700 | ||
| 2270 | IT Restaurants | dfs and similar dp trees | Statement | E | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 1800 | ||
| 519 | Cowboys | combinatorics dp math | Statement | C | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2200 | ||
| 3329 | Relay Race | dp | Statement | C | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2100 | |
| 2000 | Numbers | combinatorics dp | Statement | B | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2200 | |
| 698 | Periodical Numbers | combinatorics dp number theory | Statement | E | Codeforces Round 132 (Div. 2) {215} | PROGRAMMING | Codeforces Round #132 (Div. 2) Tutorial | 2600 | |
| 401 | Formurosa | divide and conquer dp expression parsing | Statement | C | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2500 | |
| 7275 | Color Stripe | brute force dp greedy | Statement | C | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1600 | |
| 13058 | Choosing Capital for Treeland | dfs and similar dp graphs trees | Statement | D | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 1900 | |
| 3720 | Decoding Genome | dp matrices | Statement | E | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач Codeforces Round #137 (Div. 2) | 2000 | |
| 2042 | Two Strings | data structures dp strings | Statement | B | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 2000 | ||
| 10320 | Barcode | dp matrices | Statement | C | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | 1800 | ||
| 564 | Fractal Detector | dp hashing | Statement | C | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 2200 | |
| 2668 | Towers | dp greedy two pointers | Statement | D | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 2000 | |
| 617 | Gifts | combinatorics dp math probabilities | Statement | E | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 2500 | |
| 2379 | Cactus | data structures dfs and similar dp graphs trees | Statement | E | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 2400 | |
| 1697 | Table | bitmasks combinatorics dp math | Statement | B | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2200 | |
| 341 | Doe Graphs | constructive algorithms divide and conquer dp graphs shortest paths | Statement | C | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 1023 | Quick Tortoise | bitmasks divide and conquer dp | Statement | E | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2900 | |
| 6010 | Weather | dp implementation | Statement | C | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1300 | ||
| 2004 | Fence | dp | Statement | F | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 1900 | ||
| 4486 | Let's Play Osu! | dp math probabilities | Statement | B | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 2100 | |
| 963 | Number Challenge | combinatorics dp implementation math number theory | Statement | E | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 2600 | |
| 1396 | World Eater Brothers | dfs and similar dp greedy trees | Statement | C | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2200 | |
| 281 | Tape Programming | data structures implementation | Statement | D | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 529 | Meeting Her | dp graphs shortest paths | Statement | E | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 1488 | Easy Tape Programming | brute force implementation | Statement | B | Codeforces Round 148 (Div. 2) {239} | PROGRAMMING | Editorial for Codeforces Round #148 | 1500 | |
| 252 | Cubes | data structures dp geometry two pointers | Statement | D | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2700 | |
| 9526 | Queries for Number of Palindromes | dp hashing strings | Statement | H | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1900 | |
| 4768 | Blood Cousins Return | binary search data structures dfs and similar dp sortings | Statement | E | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 2300 | |
| 693 | Piglet's Birthday | dp math probabilities | Statement | E | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2700 | |
| 600 | Donkey and Stars | data structures dp geometry math sortings | Statement | D | Codeforces Round 152 (Div. 1) {249} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2600 | |
| 1160 | Number Transformation | dp greedy number theory | Statement | C | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 2500 | |
| 211 | Tree and Table | dfs and similar dp implementation trees | Statement | E | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 3000 | |
| 12500 | Physics Practical | binary search dp sortings two pointers | Statement | B | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1400 | |
| 737 | Dormitory | dp implementation | Statement | E | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 2400 | |
| 5087 | Almost Arithmetical Progression | brute force dp | Statement | C | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1700 | |
| 299 | Liars and Serge | dp | Statement | D | Codeforces Round 156 (Div. 1) {256} | PROGRAMMING | qwer | 2700 | |
| 1621 | Little Elephant and Elections | brute force combinatorics dp | Statement | B | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2100 | |
| 2021 | Little Elephant and LCM | binary search combinatorics dp math | Statement | C | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 1564 | Little Elephant and Broken Sorting | dp math probabilities | Statement | D | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2600 | |
| 1637 | Maxim and Restaurant | dp math probabilities | Statement | B | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2100 | |
| 846 | Maxim and Matrix | constructive algorithms dp math | Statement | C | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2300 | |
| 725 | Maxim and Increasing Subsequence | dp | Statement | D | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2500 | |
| 448 | Maxim and Calculator | brute force dp two pointers | Statement | E | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2800 | |
| 457 | Rhombus | brute force data structures dp | Statement | E | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 2600 | |
| 12359 | Good Sequences | dp number theory | Statement | B | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 1700 | |
| 3359 | Choosing Balls | dp | Statement | C | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 2200 | |
| 455 | Colorful Stones | dp two pointers | Statement | D | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial for E | 2400 | |
| 484 | Roadside Trees | data structures dp | Statement | E | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 2900 | |
| 633 | Wall Bars | dp | Statement | D | Codeforces Round 164 (Div. 2) {268} | PROGRAMMING | Codeforces Round #164 (Div. 2) — Problems Analysis | 2600 | |
| 7120 | Greenhouse Effect | dp | Statement | B | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2000 | |
| 535 | Maximum Waterfall | data structures dp graphs sortings | Statement | D | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 498 | Dima and Figure | dp | Statement | D | Codeforces Round 167 (Div. 1) {273} | PROGRAMMING | Tutorial | 2400 | |
| 409 | Dima and Game | dp games | Statement | E | Codeforces Round 167 (Div. 1) {273} | PROGRAMMING | Tutorial | 2600 | |
| 5696 | Zero Tree | dfs and similar dp greedy trees | Statement | B | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 2000 | |
| 16818 | Little Girl and Maximum XOR | bitmasks dp greedy implementation math | Statement | D | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1800 | |
| 442 | Google Code Jam | dp probabilities | Statement | D | Codeforces Round 170 (Div. 1) {277} | PROGRAMMING | Codeforces Round #170 Tutorial | 2700 | |
| 9048 | Ladder | dp implementation two pointers | Statement | C | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Unofficial editorial for Codeforces Round #171 (Div. 2) | 1700 | |
| 1633 | Beautiful Decomposition | dp games greedy number theory | Statement | E | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Codeforces Round #171 (Div. 2) Разбор Задач | 2100 | |
| 886 | The Minimum Number of Variables | bitmasks dp | Statement | D | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Unofficial editorial for Codeforces Round #171 (Div. 2) | 2600 | |
| 344 | Sequence Transformation | data structures dp implementation math | Statement | E | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | Codeforces Round #172 Editorial | 3000 | |
| 1685 | Yet Another Number Game | dp games | Statement | D | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 2100 | |
| 3965 | Cow Program | dfs and similar dp graphs | Statement | B | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 1900 | |
| 1612 | Coin Troubles | dp | Statement | C | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Math Problems on Codeforces #174 | 2300 | |
| 718 | Cows and Cool Sequences | dp math number theory | Statement | D | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 2400 | |
| 1707 | Permutation Sum | bitmasks combinatorics dp implementation meet-in-the-middle | Statement | D | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 1900 | |
| 1388 | Positions in Permutations | combinatorics dp math | Statement | E | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 2600 | |
| 408 | Polo the Penguin and Lucky Numbers | dp implementation math | Statement | E | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 2800 | |
| 19180 | Polo the Penguin and Matrix | brute force dp implementation sortings ternary search | Statement | B | Codeforces Round 177 (Div. 2) {289} | PROGRAMMING | Codeforces Round #177, editorial | 1400 | |
| 2825 | Connected Components | data structures dfs and similar dp dsu | Statement | D | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1900 | |
| 5093 | Shaass and Bookshelf | dp greedy | Statement | B | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 1700 | |
| 1201 | Shaass the Great | dp trees | Statement | E | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 2700 | |
| 18628 | Greg and Graph | dp graphs shortest paths | Statement | B | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1900 | |
| 764 | Greg and Caves | combinatorics dp | Statement | D | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2400 |