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 ... 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1982 | Greg and Friends | combinatorics dp graphs shortest paths | Statement | C | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 2754 | Yaroslav and Two Strings | combinatorics dp | Statement | B | Codeforces Round 179 (Div. 2) {296} | PROGRAMMING | Codeforces Round #179 tutorial | 2000 | |
| 453 | Mystic Carvings | data structures | Statement | E | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial | 3000 | |
| 874 | Painting Square | dp fft | Statement | D | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 2700 | |
| 510 | Yaroslav and Arrangements | dp | Statement | E | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2900 | |
| 473 | Random Ranking | dp math probabilities | Statement | E | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2800 | |
| 966 | Context Advertising | dp two pointers | Statement | B | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2100 | |
| 4447 | Cats Transport | data structures dp | Statement | B | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2400 | |
| 56701 | Ilya and Queries | dp implementation | Statement | B | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 1200 | |
| 1747 | Ilya and Roads | dp | Statement | D | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2100 | |
| 2092 | Sereja and Subsequences | data structures dp | Statement | C | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2300 | |
| 440 | Sereja and Squares | dp | Statement | E | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2900 | |
| 1792 | EKG | dfs and similar dp | Statement | B2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1600 | |
| 630 | PE Lesson | brute force dp | Statement | D1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2300 | |
| 551 | PE Lesson | dp | Statement | D2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2300 | |
| 745 | PE Lesson | dp math | Statement | D3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2400 | |
| 1300 | Game with Powers | dp games | Statement | D | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2200 | |
| 6888 | Kalila and Dimna in the Logging Industry | dp geometry | Statement | C | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2400 | |
| 3933 | Ciel and Duel | dp flows greedy | Statement | B | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2000 | |
| 6602 | Ciel and Gondolas | data structures divide and conquer dp | Statement | E | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2600 | |
| 658 | Ciel and Flipboard | dp greedy math | Statement | D | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2900 | |
| 51482 | Flipping Game | brute force dp implementation | Statement | A | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 1200 | |
| 1636 | Axis Walking | bitmasks combinatorics constructive algorithms dp meet-in-the-middle | Statement | E | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 2500 | |
| 7175 | The Great Julya Calendar | dp | Statement | C1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1200 | |
| 449 | The Great Julya Calendar | dp | Statement | C2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2400 | |
| 632 | The Great Julya Calendar | dp | Statement | C3 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2500 | |
| 237 | Deja Vu | constructive algorithms dp | Statement | E2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 3000 | |
| 8832 | Maximum Absurdity | data structures dp implementation | Statement | B | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 1500 | |
| 355 | Binary Key | dp greedy implementation | Statement | E | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 2600 | |
| 2404 | Palindrome | constructive algorithms dp | Statement | B | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 1900 | |
| 372 | Rectangles and Square | brute force dp | Statement | D | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2400 | |
| 770 | Buy One, Get One Free | dp greedy | Statement | F | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2900 | |
| 264 | Counting Skyscrapers | dp math probabilities | Statement | E | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2900 | |
| 158 | Vasily the Bear and Painting Square | bitmasks combinatorics dp implementation | Statement | E | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 2600 | |
| 7086 | Book of Evil | dfs and similar divide and conquer dp trees | Statement | D | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2100 | |
| 8817 | Xenia and Weights | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | C | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 8009 | Bubble Sort Graph | binary search data structures dp | Statement | D | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1800 | |
| 585 | Xenia and Dominoes | bitmasks dfs and similar dp | Statement | D | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2500 | |
| 4424 | Lucky Common Subsequence | dp strings | Statement | B | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2000 | |
| 888 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2600 | |
| 2317 | Turtles | dp matrices | Statement | D | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2500 | |
| 648 | Pilgrims | dfs and similar dp trees | Statement | E | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2800 | |
| 15251 | Color the Fence | data structures dp greedy implementation | Statement | B | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 322 | Looking for Owls | binary search data structures geometry hashing sortings | Statement | D | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2600 | |
| 3110 | Jeff and Rounding | dp greedy implementation math | Statement | A | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 1900 | |
| 2780 | Jeff and Furik | combinatorics dp probabilities | Statement | B | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2100 | |
| 662 | Jeff and Brackets | dp matrices | Statement | C | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2800 | |
| 3221 | Queue | constructive algorithms dp | Statement | D | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 2100 | |
| 701 | Antichain | dp graph matchings greedy | Statement | E | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 2600 | |
| 3386 | Vasya and Beautiful Arrays | brute force dp number theory | Statement | C | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2000 | |
| 935 | Lucky Number Representation | constructive algorithms dfs and similar dp | Statement | E | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2200 | |
| 529 | Game with Strings | bitmasks dp games | Statement | B | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2500 | |
| 528 | Transferring Pyramid | dp | Statement | D | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2900 | |
| 1144 | Bags and Coins | bitmasks constructive algorithms dp greedy | Statement | D | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2500 | |
| 605 | Xenia and String Problem | dp hashing implementation string suffix structures strings | Statement | E | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2800 | |
| 4565 | Dima and Hares | dp greedy | Statement | D | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2000 | |
| 8804 | Permutation | constructive algorithms dp math | Statement | B | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 1400 | |
| 3646 | Levko and Array | binary search dp | Statement | B | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2300 | |
| 1277 | Levko and Strings | combinatorics dp | Statement | C | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2700 | |
| 2039 | Insertion Sort | data structures dp implementation math | Statement | C | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 2000 | |
| 70175 | Fence | brute force dp | Statement | B | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1200 | |
| 1278 | Free Market | dp greedy | Statement | B | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 2300 | |
| 4848 | Dima and Guards | implementation | Statement | A | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1100 | |
| 6159 | Dima and Salad | dp | Statement | C | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1900 | |
| 1451 | Sereja and Intervals | combinatorics dp | Statement | E | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2600 | |
| 51150 | Sereja and Suffixes | data structures dp | Statement | B | Codeforces Round 215 (Div. 2) {368} | PROGRAMMING | Codeforces Round #215 — tutorial | 1100 | |
| 1329 | Valera and Fools | dfs and similar dp graphs shortest paths | Statement | D | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2300 | |
| 348 | Summer Reading | dp greedy | Statement | E | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 2500 | |
| 2867 | Counting Rectangles is Fun | brute force divide and conquer dp | Statement | B | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2100 | |
| 5141 | Watching Fireworks is Fun | data structures dp math | Statement | C | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2400 | |
| 3040 | Inna and Dima | dfs and similar dp graphs implementation | Statement | C | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2000 | |
| 1038 | Inna and Sequence | binary search data structures dp trees | Statement | D | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2300 | |
| 245 | Inna and Babies | binary search data structures dsu geometry implementation | Statement | E | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2600 | |
| 5464 | Maximum Submatrix 2 | data structures dp implementation sortings | Statement | B | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 1800 | |
| 670 | Red and Black Tree | dp implementation math | Statement | E | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 3000 | |
| 1441 | Captains Mode | bitmasks dp games | Statement | C | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2400 | |
| 597 | Cookie Clicker | dp geometry | Statement | E | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2700 | |
| 1683 | New Year Letter | bitmasks brute force dp | Statement | D | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2000 | |
| 345 | New Year Cactus | dp | Statement | G | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 3100 | |
| 469 | Ksenia and Combinatorics | combinatorics dp | Statement | E | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2600 | |
| 3413 | Antimatter | dp | Statement | D | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2300 | |
| 4657 | Vowels | combinatorics divide and conquer dp | Statement | E | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2700 | |
| 10790 | Bear and Prime Numbers | binary search brute force data structures dp implementation math number theory | Statement | C | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1800 | |
| 972 | Bear and Floodlight | bitmasks dp geometry | Statement | D | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 2500 | |
| 972 | Diverse Substrings | dp strings two pointers | Statement | C | Testing Round 9 {386} | PROGRAMMING | 2100 | ||
| 584 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 228 | Stock Trading | dp | Statement | F1 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | ||
| 1066 | Tower of Hanoi | dp | Statement | B | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1000.0 | 83942 | |
| 2735 | On Segment's Own Points | implementation | Statement | A | Codeforces Round 232 (Div. 2) {397} | PROGRAMMING | 500.0 | Codeforces Round #232 Editorial (restored) | |
| 1214 | Painting The Wall | dp probabilities | Statement | B | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | |
| 4748 | Roman and Numbers | bitmasks brute force combinatorics dp number theory | Statement | D | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2000 | |
| 2804 | Upgrading Array | dp greedy math number theory | Statement | D | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2000 | |
| 1255 | Beautiful Pairs of Numbers | combinatorics dp | Statement | D | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 2497 | Minesweeper 1D | dp implementation | Statement | D | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2200 | |
| 1317 | Hill Climbing | dfs and similar geometry trees | Statement | D | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2200 | |
| 7238 | Long Path | dp implementation | Statement | B | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 1800 | |
| 840 | Largest Submatrix 3 | dp hashing | Statement | D | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 2600 | |
| 938 | 2048 | bitmasks dp | Statement | D | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 2100 | |
| 30551 | Mashmokh and ACM | combinatorics dp number theory | Statement | B | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 9472 | Art Union | brute force dp implementation | Statement | B | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1300 | |
| 8820 | Booking System | binary search dp greedy implementation | Statement | C | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1600 | |
| 1887 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2400 | |
| 3439 | Elimination | dp implementation math | Statement | A | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 2997 | Cunning Gena | bitmasks dp greedy sortings | Statement | D | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | 2000 | ||
| 639 | Biathlon Track | binary search brute force constructive algorithms data structures dp | Statement | D | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2200 | |
| 151 | Colored Jenga | dfs and similar dp probabilities | Statement | E | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2500 | |
| 1017 | Sereja and Two Sequences | data structures dp | Statement | C | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 849 | Sereja and Sets | dp | Statement | E | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2500 | |
| 2742 | Match & Catch | dp string suffix structures strings | Statement | D | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 2000 | |
| 10510 | Working out | dp | Statement | B | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 1800 | |
| 1059 | Guess the Tree | bitmasks constructive algorithms dp greedy trees | Statement | C | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2400 | |
| 30597 | k-Tree | dp implementation trees | Statement | C | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 1600 | |
| 2966 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 12675 | 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 | |
| 56513 | Kuriyama Mirai's Stones | dp implementation sortings | Statement | B | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1200 | |
| 577 | Tachibana Kanade's Tofu | dp | Statement | E | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 2500 | |
| 856 | Special Grid | brute force dp greedy | Statement | D | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 2200 | |
| 375 | Pudding Monsters | dp | Statement | D | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2700 | |
| 608 | Banners | brute force data structures dp | Statement | F | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2900 | |
| 865 | The Child and Polygon | dp geometry | Statement | E | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 2600 | |
| 1919 | Devu and Birthday Celebration | combinatorics dp math | Statement | E | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 2600 | |
| 995 | Berland Federalization | dp trees | Statement | D | Testing Round 10 {440} | PROGRAMMING | 2600 | ||
| 836 | Valera and Number | bitmasks dp math probabilities | Statement | E | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 2700 | |
| 13685 | DZY Loves Sequences | dp implementation two pointers | Statement | A | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1700 | |
| 11112 | Painting Fence | divide and conquer dp greedy | Statement | C | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Codeforces Round #256 — Разбор | 1900 | |
| 6464 | Jzzhu and Numbers | bitmasks combinatorics dp | Statement | D | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2400 | |
| 354 | Jzzhu and Squares | dp math number theory | Statement | E | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2900 | |
| 5580 | Little Pony and Harmony Chest | bitmasks brute force dp | Statement | B | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2200 | |
| 685 | Little Pony and Elements of Harmony | dp matrices | Statement | D | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2900 | |
| 74707 | Boredom | dp | Statement | A | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 1600 | |
| 7112 | 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 | |
| 6625 | Civilization | dfs and similar dp dsu ternary search trees | Statement | C | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2200 | |
| 128 | An easy problem about trees | dp games greedy trees | Statement | F | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 3000 | |
| 6031 | Pashmak and Graph | dp sortings | Statement | E | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 2100 | |
| 7326 | Appleman and Tree | dfs and similar dp trees | Statement | B | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2200 | |
| 7443 | Gargari and Permutations | dfs and similar dp graphs implementation | Statement | D | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2000 | |
| 1978 | Substitutes in Number | dp | Statement | C | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2200 | |
| 800 | World of Darkraft - 2 | dp probabilities | Statement | D | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2600 | |
| 42905 | Number of Ways | binary search brute force data structures dp two pointers | Statement | C | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1700 | |
| 3922 | Increase Sequence | combinatorics dp | Statement | D | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2300 | |
| 16997 | George and Job | dp implementation | Statement | C | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 1700 | |
| 2086 | Fedor and Essay | dfs and similar dp graphs hashing strings | Statement | D | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | 2100 | ||
| 879 | Alex and Complicated Task | data structures dp greedy | Statement | E | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 2900 | |
| 521 | Permanent | dp graph matchings math meet-in-the-middle | Statement | E | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3100 | |
| 131 | MUH and Lots and Lots of Segments | data structures dsu | Statement | E | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 2700 | |
| 31882 | Flowers | dp | Statement | D | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1700 | |
| 4396 | Pillars | binary search data structures dp sortings trees | Statement | E | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 707 | Strongly Connected City 2 | dfs and similar | Statement | E | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2600 | |
| 38059 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 2154 | 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 | |
| 7381 | Red-Green Towers | dp | Statement | D | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 2100 | |
| 5732 | Riding in a Lift | combinatorics dp | Statement | E | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 2000 | |
| 527 | Parcels | dp graphs | Statement | D | Codeforces Round 274 (Div. 1) {480} | PROGRAMMING | Codeforces Round #274: editorial | 2600 | |
| 646 | Random Function and Tree | combinatorics dp trees | Statement | D | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2600 | |
| 1034 | Game with Strings | bitmasks dp probabilities | Statement | C | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2800 | |
| 3104 | Kindergarten | data structures dp greedy | Statement | D | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2400 | |
| 4437 | Valid Sets | dfs and similar dp math trees | Statement | D | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 2300 | |
| 2739 | LIS of Sequence | data structures dp greedy hashing math | Statement | E | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 2400 | |
| 4378 | Strip | binary search data structures dp two pointers | Statement | B | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2300 | |
| 58756 | BerSU Ball | dfs and similar dp graph matchings greedy sortings two pointers | Statement | B | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1300 | |
| 52647 | Given Length and Sum of Digits... | dp greedy implementation | Statement | C | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1400 | |
| 1982 | Special Matrices | combinatorics dp | Statement | F | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 2200 | |
| 1195 | Hiking | binary search dp | Statement | E | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 2700 | |
| 1956 | Treeland Tour | data structures dfs and similar dp trees | Statement | F | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 2500 | |
| 3256 | Obsessive String | dp strings | Statement | B | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2300 | |
| 713 | Birthday | data structures dfs and similar dp trees | Statement | D | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2700 | |
| 994 | Helping People | dp probabilities | Statement | C | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2900 | |
| 357 | Subsequences Return | dp matrices | Statement | E | Codeforces Round 283 (Div. 1) {497} | PROGRAMMING | 15208 | 2900 | |
| 1276 | Traffic Jams in the Land | data structures dp number theory | Statement | D | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2400 | |
| 1322 | Name That Tune | dp probabilities two pointers | Statement | B | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2500 | |
| 616 | Stairs and Lines | dp matrices | Statement | E | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2600 | |
| 1618 | New Year Domino | data structures dp dsu | Statement | E | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 2200 | |
| 864 | New Year Shopping | divide and conquer dp | Statement | F | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 2600 | |
| 15181 | Mr. Kitayuta's Colorful Graph | dfs and similar dp dsu graphs | Statement | B | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 1500 | |
| 7497 | Mr. Kitayuta, the Treasure Hunter | dfs and similar dp two pointers | Statement | C | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 2100 | |
| 1036 | Mr. Kitayuta's Gift | combinatorics dp matrices strings | Statement | E | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2900 | |
| 3313 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 2193 | The Maths Lecture | dp implementation | Statement | D | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 2500 | |
| 1978 | Arthur and Brackets | dp greedy | Statement | E | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 2400 | |
| 2454 | Sums of Digits | dp greedy implementation | Statement | C | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 2000 | |
| 1207 | Progress Monitoring | dp | Statement | F | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 2600 | |
| 6537 | Fox And Jumping | bitmasks brute force dp math | Statement | D | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 2100 | |
| 631 | Fox And Polygon | constructive algorithms divide and conquer | Statement | E | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2800 | ||
| 1210 | Fox And Travelling | dp trees | Statement | D | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2900 | ||
| 1857 | Inversions problem | brute force dfs and similar dp meet-in-the-middle | Statement | G1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 753 | Inversions problem | dp probabilities | Statement | G2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2400 | |
| 598 | Subarray Cuts | dp | Statement | E1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2500 | |
| 658 | Subarray Cuts | dp | Statement | E2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2700 | |
| 332 | Inversions problem | dp | Statement | G3 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 3200 | |
| 1797 | Darth Vader and Tree | dp matrices | Statement | E | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 2500 | |
| 1578 | Drazil and Morning Exercise | dfs and similar dp dsu trees two pointers | Statement | D | Codeforces Round 292 (Div. 1) {516} | PROGRAMMING | 16468 | 2800 | |
| 8461 | Ilya and Escalator | combinatorics dp math probabilities | Statement | D | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | Codeforces Round #293 (Div.2) Editorial | 1900 | |
| 443 | Pasha and Pipe | binary search brute force combinatorics dp implementation | Statement | F | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | Codeforces Round #293 (Div.2) Editorial | 2800 | |
| 6937 | A and B and Interesting Substrings | data structures dp two pointers | Statement | D | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | Editorial | 1900 | |
| 8908 | A and B and Lecture Rooms | binary search data structures dfs and similar dp trees | Statement | E | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | 2300 | ||
| 2143 | Pluses everywhere | combinatorics dp math number theory | Statement | E | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 2500 | |
| 9613 | Photo to Remember | *special data structures dp implementation | Statement | B | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 19339 | Reposts | *special dfs and similar dp graphs trees | Statement | A | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 1559 | Фото на память - 2 (round version) | dp greedy | Statement | B | VK Cup 2015 - Round 1 {524} | PROGRAMMING | 1700 | ||
| 4386 | Anya and Cubes | binary search bitmasks brute force dp math meet-in-the-middle | Statement | E | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2200 | |
| 1193 | Transmitting Levels | dp implementation | Statement | E | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2400 | |
| 5122 | Clique Problem | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2100 | |
| 2455 | 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 | |
| 2725 | 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 | ||
| 371 | Landmarks | data structures dp | Statement | D | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 3000 | ||
| 11492 | Covered Path | dp greedy math | Statement | B | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 1400 | ||
| 566 | Simplified Nonogram | bitmasks dp hashing meet-in-the-middle | Statement | F | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2900 | ||
| 27065 | Tavas and SaDDas | bitmasks brute force combinatorics implementation | Statement | B | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1100 | |
| 845 | Tavas in Kansas | dp games | Statement | D | Codeforces Round 299 (Div. 1) {536} | PROGRAMMING | Codeforces Round #299 Editorial | 2800 | |
| 19552 | Quasi Binary | constructive algorithms dp greedy implementation | Statement | B | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1400 | |
| 1670 | Demiurges Play Again | dfs and similar dp math trees | Statement | E | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 2200 | |
| 6780 | Bad Luck Island | dp probabilities | Statement | D | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2100 | |
| 1009 | Quest | dp greedy | Statement | F | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2100 | |
| 543 | Superhero's Job | dfs and similar dp hashing math number theory | Statement | D | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 8974 | Writing Code | dp | Statement | A | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 1900 | |
| 3397 | Road Improvement | dp trees | Statement | D | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 1603 | Remembering Strings | bitmasks dp | Statement | C | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2600 | |
| 34127 | Woodcutters | dp greedy | Statement | C | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1500 | |
| 14089 | Soldier and Number Game | constructive algorithms dp math number theory | Statement | D | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1700 | |
| 11487 | Mike and Feet | binary search data structures dp dsu | Statement | B | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2100 | |
| 3540 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 9096 | Mike and Fun | brute force dp greedy implementation | Statement | B | Codeforces Round 305 (Div. 2) {548} | PROGRAMMING | Codeforces Round #305 Editorial | 1400 | |
| 44464 | Two Substrings | brute force dp greedy implementation strings | Statement | A | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 32731 | Divisibility by Eight | brute force dp math | Statement | C | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 5897 | Vanya and Scales | brute force dp greedy math meet-in-the-middle number theory | Statement | C | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1800 | |
| 1767 | 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 | |
| 10120 | Kyoya and Colored Balls | combinatorics dp math | Statement | A | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 1700 | |
| 735 | Kyoya and Train | dp fft graphs math probabilities | Statement | E | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 3300 | |
| 4142 | Case of Fugitive | data structures greedy sortings | Statement | B | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2100 | |
| 961 | Case of a Top Secret | binary search implementation math | Statement | D | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2500 | |
| 4256 | Arthur and Table | brute force data structures dp greedy math sortings | Statement | C | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1900 | |
| 1253 | 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 | |
| 8380 | Gerald and Giant Chess | combinatorics dp math number theory | Statement | C | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2500 | |
| 1349 | Gerald and Path | dp sortings | Statement | E | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2900 | |
| 4356 | Clique in the Divisibility Graph | dp math number theory | Statement | F | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1600 | |
| 10589 | Geometric Progression | binary search data structures dp | Statement | C | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1700 | |
| 663 | Mausoleum | dp | Statement | F | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2700 | |
| 2399 | Symmetric and Transitive | combinatorics dp math | Statement | B | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 2100 | |
| 688 | Longest Increasing Subsequence | data structures dp | Statement | E | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 3000 | |
| 2159 | Pig and Palindromes | combinatorics dp | Statement | E | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2600 | |
| 2889 | Minimization | dp greedy sortings | Statement | B | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 2300 | |
| 6422 | Bear and Blocks | binary search data structures dp math | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1800 | |
| 1056 | Bear and Drawing | constructive algorithms dfs and similar trees | Statement | C | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 2600 | |
| 888 | Bear and Cavalry | data structures divide and conquer dp | Statement | D | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 2900 | |
| 1131 | Bulbo | dp greedy | Statement | F | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2200 | |
| 1673 | Flights for Regular Customers | dp matrices | Statement | D | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2600 | |
| 15676 | Modulo Sum | combinatorics data structures dp two pointers | Statement | B | Codeforces Round 319 (Div. 2) {577} | PROGRAMMING | Editorial Codeforces Round #319 | 1800 | |
| 995 | LCS Again | dp greedy | Statement | D | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 2800 | |
| 108245 | Kefa and First Steps | brute force dp implementation | Statement | A | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1000 |