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 ... 7 8 9 10 11 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6274 | No to Palindromes! | greedy strings | Statement | A | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 1700 | |
| 1982 | Substitutes in Number | dp | Statement | C | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2200 | |
| 1803 | Restore Cube | brute force geometry | Statement | B | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2200 | |
| 802 | World of Darkraft - 2 | dp probabilities | Statement | D | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2600 | |
| 2033 | The Classic Problem | data structures graphs shortest paths | Statement | E | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2900 | |
| 10944 | Inbox (100500) | implementation | Statement | B | Codeforces Round 265 (Div. 2) {465} | PROGRAMMING | Codeforces Round #265 Editorial | 1000 | |
| 10513 | inc ARG | implementation | Statement | A | Codeforces Round 265 (Div. 2) {465} | PROGRAMMING | Codeforces Round #265 Editorial | 900 | |
| 79585 | Cheap Travel | implementation | Statement | A | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1200 | |
| 43210 | 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 | |
| 5358 | Wonder Room | brute force math | Statement | B | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1800 | |
| 3989 | Increase Sequence | combinatorics dp | Statement | D | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2300 | |
| 2735 | Information Graph | dfs and similar dsu graphs trees | Statement | E | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2400 | |
| 44003 | Fedor and New Game | bitmasks brute force constructive algorithms implementation | Statement | B | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 1200 | |
| 17111 | George and Job | dp implementation | Statement | C | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 1700 | |
| 2099 | Fedor and Essay | dfs and similar dp graphs hashing strings | Statement | D | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | 2100 | ||
| 884 | Alex and Complicated Task | data structures dp greedy | Statement | E | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 2900 | |
| 162355 | George and Accommodation | implementation | Statement | A | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 800 | |
| 8652 | 24 Game | constructive algorithms greedy math | Statement | A | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 1600 | |
| 5548 | Two Sets | 2-sat dfs and similar dsu graph matchings greedy | Statement | B | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2000 | |
| 2840 | Hack it! | binary search constructive algorithms math | Statement | C | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2800 | |
| 679 | Tree | graph matchings | Statement | D | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3000 | |
| 531 | Permanent | dp graph matchings math meet-in-the-middle | Statement | E | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3100 | |
| 125850 | I Wanna Be the Guy | greedy implementation | Statement | A | Codeforces Round 268 (Div. 2) {469} | PROGRAMMING | Codeforces Round #268 Editorial | 1000 | |
| 13468 | Chat Online | implementation | Statement | B | Codeforces Round 268 (Div. 2) {469} | PROGRAMMING | Codeforces Round #268 Editorial | 1300 | |
| 697 | Crystal Ball Sequence | *special implementation | Statement | A | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 1400 | |
| 274 | Hexakosioihexekontahexaphobia | *special | Statement | B | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 1800 | |
| 206 | Chessboard | *special | Statement | E | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 1900 | |
| 263 | Eval | *special | Statement | C | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2100 | |
| 159 | Caesar Cipher | *special | Statement | D | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2200 | |
| 115 | Pairwise Sums | *special | Statement | F | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2300 | |
| 132 | Hamming Distance | *special | Statement | G | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2500 | |
| 195 | Array Sorting | *special | Statement | H | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2600 | |
| 13837 | MUH and Sticks | implementation | Statement | A | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1200 | |
| 6237 | MUH and Important Things | implementation sortings | Statement | B | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1400 | |
| 3759 | MUH and House of Cards | binary search brute force greedy math | Statement | C | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1700 | |
| 10994 | MUH and Cube Walls | string suffix structures strings | Statement | D | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 2000 | |
| 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 | |
| 7692 | Design Tutorial: Learn from Life | Statement | B | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1300 | ||
| 6547 | Design Tutorial: Make It Nondeterministic | greedy | Statement | C | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1400 | |
| 6805 | Design Tutorial: Inverse the Problem | dfs and similar dsu shortest paths trees | Statement | D | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1900 | |
| 318 | Design Tutorial: Change the Goal | constructive algorithms math matrices | Statement | F | Codeforces Round 270 {472} | PROGRAMMING | 2600 | ||
| 153 | Design Tutorial: Learn from a Game | constructive algorithms implementation | Statement | E | Codeforces Round 270 {472} | PROGRAMMING | 2700 | ||
| 509 | Design Tutorial: Increase the Constraints | bitmasks data structures fft | Statement | G | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 2800 | |
| 72487 | Design Tutorial: Learn from Math | math number theory | Statement | A | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 900 | |
| 57336 | Keyboard | implementation | Statement | A | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1000 | |
| 66753 | Worms | binary search implementation | Statement | B | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1300 | |
| 32236 | Flowers | dp | Statement | D | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1700 | |
| 3438 | Captain Marmot | brute force geometry | Statement | C | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1900 | |
| 4457 | Pillars | binary search data structures dp sortings trees | Statement | E | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 12530 | Ant colony | data structures math number theory | Statement | F | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 4987 | Bayan Bus | implementation | Statement | A | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 1300 | |
| 9428 | Strongly Connected City | brute force dfs and similar graphs implementation | Statement | B | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 1400 | |
| 7061 | CGCDSSQ | brute force data structures math | Statement | D | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2000 | |
| 863 | Kamal-ol-molk's Painting | brute force constructive algorithms greedy | Statement | C | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2100 | |
| 721 | Strongly Connected City 2 | dfs and similar | Statement | E | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2600 | |
| 284 | Meta-universe | data structures | Statement | F | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2800 | |
| 53040 | Dreamoon and Stairs | implementation math | Statement | A | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 1100 | |
| 38421 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 6071 | Dreamoon and Sums | math | Statement | C | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 1700 | |
| 5106 | Dreamoon and Sets | constructive algorithms greedy math | Statement | D | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 2000 | |
| 2164 | 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 | |
| 167 | Dreamoon and Notepad | data structures | Statement | E | Codeforces Round 272 (Div. 1) {477} | PROGRAMMING | 3100 | ||
| 27431 | Initial Bet | implementation | Statement | A | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 1200 | |
| 42264 | Random Teams | combinatorics constructive algorithms greedy math | Statement | B | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 1300 | |
| 21028 | Table Decorations | greedy | Statement | C | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 1700 | |
| 7454 | Red-Green Towers | dp | Statement | D | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 2100 | |
| 261 | Wavy numbers | brute force dfs and similar meet-in-the-middle sortings | Statement | E | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 2700 | |
| 115859 | Expression | brute force math | Statement | A | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 1100 | |
| 8534 | Towers | brute force constructive algorithms greedy implementation sortings | Statement | B | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 1400 | |
| 33828 | Exams | greedy sortings | Statement | C | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 1500 | |
| 5038 | Long Jumps | binary search greedy implementation | Statement | D | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 1800 | |
| 5757 | Riding in a Lift | combinatorics dp | Statement | E | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 2000 | |
| 528 | Parcels | dp graphs | Statement | D | Codeforces Round 274 (Div. 1) {480} | PROGRAMMING | Codeforces Round #274: editorial | 2600 | |
| 669 | Parking Lot | data structures divide and conquer | Statement | E | Codeforces Round 274 (Div. 1) {480} | PROGRAMMING | Codeforces Round #274: editorial | 2800 | |
| 10310 | Diverse Permutation | constructive algorithms greedy | Statement | A | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 1300 | |
| 8509 | Interesting Array | constructive algorithms data structures trees | Statement | B | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2000 | |
| 654 | Random Function and Tree | combinatorics dp trees | Statement | D | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2600 | |
| 1036 | Game with Strings | bitmasks dp probabilities | Statement | C | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2800 | |
| 203 | ELCA | data structures trees | Statement | E | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 3200 | |
| 25146 | Counterexample | brute force implementation math number theory | Statement | A | Codeforces Round 275 (Div. 2) {483} | PROGRAMMING | Codeforces Round #275 Editorial | 1100 | |
| 4467 | Friends and Presents | binary search math | Statement | B | Codeforces Round 275 (Div. 2) {483} | PROGRAMMING | Codeforces Round #275 Editorial | 1800 | |
| 13844 | Bits | bitmasks constructive algorithms | Statement | A | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 1700 | |
| 7882 | Maximum Value | binary search math sortings two pointers | Statement | B | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2100 | |
| 3127 | Kindergarten | data structures dp greedy | Statement | D | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2400 | |
| 677 | Strange Sorting | implementation math | Statement | C | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2600 | |
| 3265 | Sign on Fence | binary search constructive algorithms data structures | Statement | E | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2700 | |
| 6830 | Valuable Resources | brute force greedy | Statement | B | Codeforces Round 276 (Div. 2) {485} | PROGRAMMING | Codeforces Round #276 — Editorial | 1300 | |
| 8848 | Factory | implementation math matrices | Statement | A | Codeforces Round 276 (Div. 2) {485} | PROGRAMMING | Codeforces Round #276 — Editorial | 1400 | |
| 160900 | Calculating Function | implementation math | Statement | A | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 1100 | |
| 19451 | OR in Matrix | greedy hashing implementation | Statement | B | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 1400 | |
| 12490 | Palindrome Transformation | brute force greedy implementation | Statement | C | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 1700 | |
| 4452 | Valid Sets | dfs and similar dp math trees | Statement | D | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 2300 | |
| 2775 | 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 | |
| 3986 | Fight the Monster | binary search brute force implementation | Statement | A | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 1900 | |
| 4422 | Strip | binary search data structures dp two pointers | Statement | B | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2300 | |
| 3175 | Prefix Product Sequence | constructive algorithms math number theory | Statement | C | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2600 | |
| 1066 | Conveyor Belts | data structures | Statement | D | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2700 | |
| 3083 | Tourists | data structures dfs and similar graphs trees | Statement | E | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 3100 | |
| 15041 | Giga Tower | brute force | Statement | A | Codeforces Round 278 (Div. 2) {488} | PROGRAMMING | Codeforces Round #278 Editorial | 1100 | |
| 2267 | Candy Boxes | brute force constructive algorithms math | Statement | B | Codeforces Round 278 (Div. 2) {488} | PROGRAMMING | Tutorial | 1800 | |
| 10693 | SwapSort | greedy implementation sortings | Statement | A | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1300 | |
| 59338 | 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 | |
| 52993 | 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 | |
| 7129 | Unbearable Controversy of Being | brute force combinatorics dfs and similar graphs | Statement | D | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1700 | |
| 1990 | 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 | |
| 1203 | 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 | |
| 6516 | Queue | dsu implementation | Statement | B | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 1500 | |
| 9542 | Hacking Cypher | brute force math number theory strings | Statement | C | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 1700 | |
| 2336 | Chocolate | brute force dfs and similar math meet-in-the-middle number theory | Statement | D | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 1900 | |
| 1729 | Restoring Increasing Sequence | binary search brute force greedy implementation | Statement | E | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 2100 | |
| 1967 | 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 | |
| 73611 | Team Olympiad | greedy implementation sortings | Statement | A | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 900 | |
| 3593 | Up the hill | constructive algorithms implementation | Statement | A | Testing Round 11 {491} | PROGRAMMING | 1200 | ||
| 694 | New York Hotel | greedy math | Statement | B | Testing Round 11 {491} | PROGRAMMING | 1900 | ||
| 552 | Deciphering | flows graph matchings | Statement | C | Testing Round 11 {491} | PROGRAMMING | 2400 | ||
| 93597 | Vanya and Lanterns | binary search implementation math sortings | Statement | B | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1200 | |
| 15606 | Vanya and Exams | greedy sortings | Statement | C | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1400 | |
| 3337 | Vanya and Computer Game | binary search implementation math sortings | Statement | D | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1800 | |
| 1780 | Vanya and Field | math | Statement | E | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 2200 | |
| 65539 | Vanya and Cubes | implementation | Statement | A | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 900 | |
| 6479 | Vasya and Football | implementation | Statement | A | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1400 | |
| 14159 | Vasya and Wrestling | implementation | Statement | B | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1500 | |
| 10325 | Vasya and Chess | constructive algorithms games math | Statement | D | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1700 | |
| 7604 | Vasya and Basketball | binary search brute force data structures implementation sortings two pointers | Statement | C | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1700 | |
| 574 | Vasya and Polynomial | math | Statement | E | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 2900 | |
| 6593 | Treasure | greedy | Statement | A | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 1700 | |
| 3274 | Obsessive String | dp strings | Statement | B | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2300 | |
| 717 | Birthday | data structures dfs and similar dp trees | Statement | D | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2700 | |
| 1003 | Helping People | dp probabilities | Statement | C | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2900 | |
| 552 | Sharti | data structures games | Statement | E | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 3200 | |
| 9160 | Digital Counter | implementation | Statement | A | Codeforces Round 282 (Div. 2) {495} | PROGRAMMING | Tutorial | 1200 | |
| 8515 | Modular Equations | math number theory | Statement | B | Codeforces Round 282 (Div. 2) {495} | PROGRAMMING | Tutorial | 1600 | |
| 17297 | Minimum Difficulty | brute force implementation math | Statement | A | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | Codeforces Round #283: editorial (with bonuses!) | 1000 | |
| 6251 | Secret Combination | brute force constructive algorithms implementation | Statement | B | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 15208 | 1500 | |
| 8231 | Removing Columns | brute force constructive algorithms implementation | Statement | C | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 15208 | 1600 | |
| 3217 | Tennis Game | binary search | Statement | D | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 15208 | 2100 | |
| 1815 | Distributing Parts | greedy sortings | Statement | E | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | Codeforces Round #283: editorial (with bonuses!) | 2600 | |
| 253 | Gears | brute force geometry math | Statement | D | Codeforces Round 283 (Div. 1) {497} | PROGRAMMING | 2800 | ||
| 358 | Subsequences Return | dp matrices | Statement | E | Codeforces Round 283 (Div. 1) {497} | PROGRAMMING | 15208 | 2900 | |
| 6959 | Crazy Town | geometry | Statement | A | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 1600 | |
| 1283 | Traffic Jams in the Land | data structures dp number theory | Statement | D | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2400 | |
| 4391 | Array and Operations | flows graph matchings number theory | Statement | C | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2400 | |
| 1332 | Name That Tune | dp probabilities two pointers | Statement | B | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2500 | |
| 620 | Stairs and Lines | dp matrices | Statement | E | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2600 | |
| 45834 | Lecture | implementation strings | Statement | B | Codeforces Round 284 (Div. 2) {499} | PROGRAMMING | 15353 | 1000 | |
| 14852 | Watching a movie | greedy implementation | Statement | A | Codeforces Round 284 (Div. 2) {499} | PROGRAMMING | 15353 | 1100 | |
| 65045 | New Year Transportation | dfs and similar graphs implementation | Statement | A | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1100 | |
| 9744 | New Year Permutation | dfs and similar dsu graphs greedy math sortings | Statement | B | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1600 | |
| 6063 | New Year Book Reading | constructive algorithms greedy implementation math | Statement | C | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1600 | |
| 3316 | New Year Santa Network | combinatorics dfs and similar graphs trees | Statement | D | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 1900 | |
| 1627 | New Year Domino | data structures dp dsu | Statement | E | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 2200 | |
| 867 | New Year Shopping | divide and conquer dp | Statement | F | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 2600 | |
| 346 | New Year Running | number theory trees | Statement | G | Good Bye 2014 {500} | PROGRAMMING | Tutorial 2 | 3000 | |
| 24497 | Contest | implementation | Statement | A | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1000 | |
| 19888 | Misha and Changing Handles | data structures dsu strings | Statement | B | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1100 | |
| 6123 | Misha and Forest | constructive algorithms data structures greedy sortings trees | Statement | C | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1700 | |
| 2780 | Misha and Permutations Summation | data structures | Statement | D | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Разбор задач Codeforces Round #285 | 2300 | |
| 987 | Misha and Palindrome Degree | binary search combinatorics implementation | Statement | E | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 2800 | |
| 380 | Misha and XOR | bitmasks | Statement | D | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 2700 | |
| 1112 | Misha and LCP on Tree | binary search dfs and similar hashing string suffix structures trees | Statement | E | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 3000 | |
| 6986 | Mr. Kitayuta's Gift | brute force implementation strings | Statement | A | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 1200 | |
| 15433 | Mr. Kitayuta's Colorful Graph | dfs and similar dp dsu graphs | Statement | B | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 1500 | |
| 7543 | Mr. Kitayuta, the Treasure Hunter | dfs and similar dp two pointers | Statement | C | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 2100 | |
| 3052 | Mr. Kitayuta's Technology | dfs and similar | Statement | D | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 2500 | |
| 1659 | Mr. Kitayuta vs. Bamboos | binary search greedy | Statement | E | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 2800 | |
| 2623 | Mr. Kitayuta's Colorful Graph | brute force dfs and similar dsu graphs | Statement | D | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2300 | |
| 1042 | Mr. Kitayuta's Gift | combinatorics dp matrices strings | Statement | E | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2900 | |
| 22393 | Amr and Music | greedy implementation sortings | Statement | A | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 1100 | |
| 27060 | Amr and Pins | geometry math | Statement | B | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 1400 | |
| 4605 | Guess Your Way Out! | implementation math trees | Statement | C | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 1700 | |
| 3352 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 2208 | The Maths Lecture | dp implementation | Statement | D | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 2500 | |
| 8498 | Pasha and Pixels | brute force | Statement | A | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 1200 | ||
| 24218 | Anton and currency you all know | greedy math strings | Statement | B | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 1300 | |
| 4695 | Anya and Ghosts | constructive algorithms greedy | Statement | C | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 1600 | ||
| 1994 | Arthur and Brackets | dp greedy | Statement | E | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 2400 | |
| 4549 | Tanya and Password | dfs and similar graphs | Statement | D | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 2900 | |
| 10028 | Painting Pebbles | constructive algorithms greedy implementation | Statement | B | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 1300 | |
| 2464 | 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 | |
| 1913 | Pretty Song | math strings | Statement | E | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 2000 | |
| 833 | Restoring Numbers | constructive algorithms math | Statement | D | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 2400 | |
| 1212 | 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 | |
| 44874 | Maximum in Table | brute force implementation | Statement | A | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 700 | |
| 16869 | Fox And Two Dots | dfs and similar | Statement | B | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 1500 | |
| 23576 | Fox And Names | dfs and similar graphs sortings | Statement | C | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 1800 | |
| 6622 | Fox And Jumping | bitmasks brute force dp math | Statement | D | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 2100 | |
| 2543 | Fox And Dinner | flows | Statement | E | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 2800 | |
| 110369 | Fox And Snake | implementation | Statement | A | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 800 | |
| 632 | Fox And Polygon | constructive algorithms divide and conquer | Statement | E | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2800 | ||
| 1224 | Fox And Travelling | dp trees | Statement | D | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2900 | ||
| 3862 | Permutations | brute force | Statement | B1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1500 | |
| 2951 | Permutations | bitmasks divide and conquer math | Statement | B2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 1862 | Inversions problem | brute force dfs and similar dp meet-in-the-middle | Statement | G1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 1734 | Second price auction | bitmasks probabilities | Statement | C | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2000 | |
| 754 | Inversions problem | dp probabilities | Statement | G2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2400 | |
| 659 | Constrained Tree | dfs and similar | Statement | D1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2400 | |
| 609 | Subarray Cuts | dp | Statement | E1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2500 | |
| 412 | Constrained Tree | constructive algorithms data structures | Statement | D2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2500 | |
| 662 | Subarray Cuts | dp | Statement | E2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2700 | |
| 398 | Scaygerboss | flows | Statement | F1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2800 | |
| 414 | Scaygerboss | flows | Statement | F2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2900 | |
| 333 | Inversions problem | dp | Statement | G3 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 3200 | |
| 21960 | Game | constructive algorithms math | Statement | A | Rockethon 2015 {513} | PROGRAMMING | 16260 | 900 | |
| 75119 | Chewbaсca and Number | greedy implementation | Statement | A | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 1200 | |
| 22894 | Han Solo and Lazer Gun | brute force data structures geometry implementation math | Statement | B | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 1400 | |
| 8573 | Watto and Mechanism | binary search data structures hashing string suffix structures strings | Statement | C | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 1900 | |
| 5708 | R2D2 and Droid Army | binary search data structures two pointers | Statement | D | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 2100 | |
| 1804 | Darth Vader and Tree | dp matrices | Statement | E | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 2500 | |
| 22398 | Drazil and Date | math | Statement | A | Codeforces Round 292 (Div. 2) {515} | PROGRAMMING | Codeforces Round #292 Editorial | 1100 | |
| 7823 | Drazil and His Happy Friends | brute force dsu meet-in-the-middle number theory | Statement | B | Codeforces Round 292 (Div. 2) {515} | PROGRAMMING | Codeforces Round #292 Editorial | 1400 | |
| 29147 | Drazil and Factorial | greedy math sortings | Statement | C | Codeforces Round 292 (Div. 2) {515} | PROGRAMMING | Codeforces Round #292 Editorial | 1400 | |
| 3053 | Drazil and Tiles | constructive algorithms greedy | Statement | D | Codeforces Round 292 (Div. 2) {515} | PROGRAMMING | Codeforces Round #292 Editorial | 2100 | |
| 2544 | Drazil and Park | data structures | Statement | E | Codeforces Round 292 (Div. 2) {515} | PROGRAMMING | Codeforces Round #292 Editorial | 2600 | |
| 1591 | Drazil and Morning Exercise | dfs and similar dp dsu trees two pointers | Statement | D | Codeforces Round 292 (Div. 1) {516} | PROGRAMMING | 16468 | 2800 | |
| 680 | Drazil and His Happy Friends | math number theory | Statement | E | Codeforces Round 292 (Div. 1) {516} | PROGRAMMING | 16468 | 3000 | |
| 8464 | Tanya and Postcard | greedy implementation strings | Statement | B | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | Codeforces Round #293 (Div.2) Editorial | 1500 | |
| 9595 | Vitaly and Strings | constructive algorithms strings | Statement | A | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | Codeforces Round #293 (Div.2) Editorial | 1600 | |
| 6415 | Anya and Smartphone | constructive algorithms data structures implementation | Statement | C | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | 1600 | ||
| 8635 | Ilya and Escalator | combinatorics dp math probabilities | Statement | D | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | Codeforces Round #293 (Div.2) Editorial | 1900 | |
| 1082 | Arthur and Questions | greedy implementation math ternary search | Statement | E | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | 2400 | ||
| 445 | 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 | |
| 20306 | A and B and Chess | implementation | Statement | A | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | Editorial | 1100 | |
| 44497 | A and B and Compilation Errors | data structures implementation sortings | Statement | B | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | 1200 | ||
| 20864 | A and B and Team Training | greedy implementation math number theory | Statement | C | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | Editorial | 1300 | |
| 6950 | A and B and Interesting Substrings | data structures dp two pointers | Statement | D | Codeforces Round 294 (Div. 2) {519} | PROGRAMMING | Editorial | 1900 | |
| 9046 | 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 | ||
| 65760 | Two Buttons | dfs and similar graphs greedy implementation math shortest paths | Statement | B | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 1400 | |
| 4348 | DNA Alignment | math strings | Statement | C | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 1700 | |
| 1701 | Cubes | games greedy implementation | Statement | D | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 2400 | |
| 2156 | Pluses everywhere | combinatorics dp math number theory | Statement | E | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 2500 | |
| 132977 | Pangram | implementation strings | Statement | A | Codeforces Round 295 (Div. 2) {520} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 900 | |
| 2010 | Shop | greedy | Statement | D | Codeforces Round 295 (Div. 1) {521} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 2700 | |
| 1338 | Cycling City | dfs and similar graphs | Statement | E | Codeforces Round 295 (Div. 1) {521} | PROGRAMMING | Codeforces Round #295 Editorial (now with bonuses!) | 2800 | |
| 19446 | Reposts | *special dfs and similar dp graphs trees | Statement | A | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 9633 | Photo to Remember | *special data structures dp implementation | Statement | B | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 1700 | |
| 4227 | Closest Equals | *special data structures | Statement | D | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 2200 | |
| 767 | Chicken or Fish? | greedy | Statement | C | VK Cup 2015 - Qualification Round 1 {522} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 1 | 2200 | |
| 2875 | Rotate, Flip and Zoom | *special implementation | Statement | A | VK Cup 2015 - Qualification Round 2 {523} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 2 | 1600 | |
| 2617 | Name Quest | *special greedy | Statement | C | VK Cup 2015 - Qualification Round 2 {523} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 2 | 1800 | |
| 1002 | Mean Requests | *special implementation | Statement | B | VK Cup 2015 - Qualification Round 2 {523} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 2 | 1800 | |
| 2610 | Statistics of Recompressing Videos | *special data structures implementation | Statement | D | VK Cup 2015 - Qualification Round 2 {523} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 2 | 1900 | |
| 1490 | Возможно, вы знаете этих людей? | implementation | Statement | A | VK Cup 2015 - Round 1 {524} | PROGRAMMING | 1600 | ||
| 1560 | Фото на память - 2 (round version) | dp greedy | Statement | B | VK Cup 2015 - Round 1 {524} | PROGRAMMING | 1700 | ||
| 2203 | The Art of Dealing with ATM | binary search sortings | Statement | C | VK Cup 2015 - Round 1 {524} | PROGRAMMING | 1800 | ||
| 1022 | Social Network | greedy two pointers | Statement | D | VK Cup 2015 - Round 1 {524} | PROGRAMMING | 2100 | ||
| 1372 | Rooks and Rectangles | data structures sortings | Statement | E | VK Cup 2015 - Round 1 {524} | PROGRAMMING | 2400 | ||
| 647 | And Yet Another Bracket Sequence | data structures greedy hashing string suffix structures strings | Statement | F | VK Cup 2015 - Round 1 {524} | PROGRAMMING | VK Cup Round 1 (+ online mirror) editorial | 2700 | |
| 16673 | Vitaliy and Pie | greedy hashing strings | Statement | A | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 1200 | |
| 10347 | Pasha and String | constructive algorithms greedy math strings | Statement | B | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 1500 |