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 ... 6 7 8 9 10 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 221 | Tree and Array | constructive algorithms | Statement | C | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 1500.0 | Codeforces Round #233 Editorial | |
| 124 | Sorting Permutations | Statement | E | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 2500.0 | Codeforces Round #233 Editorial | ||
| 1190 | Painting The Wall | dp probabilities | Statement | B | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | |
| 1265 | Instant Messanger | data structures | Statement | D | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 2000.0 | Codeforces Round #233 Editorial | |
| 962 | Cards | constructive algorithms implementation | Statement | A | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 500.0 | Codeforces Round #233 Editorial | |
| 1883 | Red and Blue Balls | Statement | B | Codeforces Round 233 (Div. 2) {399} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | ||
| 4230 | Pages | implementation | Statement | A | Codeforces Round 233 (Div. 2) {399} | PROGRAMMING | 500.0 | Codeforces Round #233 Editorial | |
| 6862 | Inna and Choose Options | implementation | Statement | A | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 1000 | |
| 8595 | Inna and New Matrix of Candies | brute force implementation schedules | Statement | B | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 1300 | |
| 3006 | Inna and Huge Candy Matrix | implementation math | Statement | C | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 1500 | |
| 3166 | Dima and Bacteria | dsu graphs shortest paths | Statement | D | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2000 | |
| 1040 | Inna and Binary Logic | binary search bitmasks data structures | Statement | E | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2400 | |
| 4597 | Sereja and Contests | greedy implementation math | Statement | B | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 1200 | |
| 21677 | Team | constructive algorithms greedy implementation | Statement | C | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 1400 | |
| 4562 | 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 | |
| 172 | Olympic Games | math | Statement | E | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2500 | |
| 17407 | Vanya and Cards | implementation math | Statement | A | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 900 | |
| 4875 | Nuts | greedy math | Statement | A | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1200 | |
| 3992 | Trees in a Row | brute force implementation | Statement | B | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1400 | |
| 6363 | Searching for Graph | brute force constructive algorithms graphs | Statement | C | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1500 | |
| 2787 | Upgrading Array | dp greedy math number theory | Statement | D | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2000 | |
| 2328 | Strictly Positive Matrix | graphs math | Statement | E | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 1233 | Beautiful Pairs of Numbers | combinatorics dp | Statement | D | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 242 | Two Rooted Trees | data structures implementation trees | Statement | E | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | Editorial Codeforces Round #236 | 2900 | |
| 26174 | Valera and X | implementation | Statement | A | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1100 | |
| 3047 | Marathon | implementation math | Statement | B | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1500 | |
| 5784 | Restore Graph | dfs and similar graphs sortings | Statement | C | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1800 | |
| 2464 | Minesweeper 1D | dp implementation | Statement | D | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2200 | |
| 641 | Maze 1D | binary search greedy implementation | Statement | E | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2700 | |
| 125999 | Gravity Flip | greedy implementation sortings | Statement | A | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1000 | |
| 6106 | Domino Effect | Statement | B | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1200 | ||
| 4929 | Unusual Product | implementation math | Statement | C | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1600 | |
| 3287 | Toy Sum | greedy implementation math | Statement | D | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1900 | |
| 1600 | Graph Cutting | dfs and similar graphs | Statement | E | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 2400 | |
| 1265 | Hill Climbing | dfs and similar geometry trees | Statement | D | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2200 | |
| 272 | Hamming Triples | implementation math two pointers | Statement | E | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2700 | |
| 5167 | Triangle | brute force geometry implementation math | Statement | A | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 1700 | |
| 7158 | Long Path | dp implementation | Statement | B | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 1800 | |
| 1189 | Curious Array | brute force combinatorics implementation math | Statement | C | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 2500 | |
| 804 | Largest Submatrix 3 | dp hashing | Statement | D | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 2600 | |
| 970 | k-d-sequence | data structures | Statement | E | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 3100 | |
| 10282 | Garland | implementation | Statement | B | Codeforces Round 239 (Div. 2) {408} | PROGRAMMING | Codeforces Round #239 Editorial | 1200 | |
| 11970 | Line to Cashier | implementation | Statement | A | Codeforces Round 239 (Div. 2) {408} | PROGRAMMING | Codeforces Round #239 Editorial | 900 | |
| 2623 | The Great Game | *special | Statement | A | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 2136 | Magnum Opus | *special | Statement | C | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 9485 | A + B Strikes Back | *special brute force constructive algorithms dsu implementation | Statement | H | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 1428 | Mysterious Language | *special | Statement | B | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1800 | |
| 1803 | Big Data | *special | Statement | D | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2000 | |
| 618 | Dome | *special | Statement | E | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2100 | |
| 2173 | 000001 | *special | Statement | F | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2300 | |
| 561 | On a plane | *special | Statement | G | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2600 | |
| 155 | Feed the Golorp | *special | Statement | I | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2900 | |
| 8093 | Password Check | implementation | Statement | A | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | Coder-Strike 2014: Qualification Round (Tutorial) | 1800 | |
| 1398 | Multi-core Processor | implementation | Statement | B | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | Coder-Strike 2014: Qualification Round (Tutorial) | 2000 | |
| 1293 | Kicker | implementation | Statement | C | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | Coder-Strike 2014: Qualification Round (Tutorial) | 2100 | |
| 4951 | Poster | greedy implementation | Statement | A | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1000 | |
| 6351 | Network Configuration | greedy sortings | Statement | B | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1000 | |
| 4213 | Pattern | implementation strings | Statement | C | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1300 | |
| 938 | E-mail Addresses | implementation | Statement | E | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1800 | |
| 2429 | Giving Awards | dfs and similar | Statement | D | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1900 | |
| 2965 | Data Recovery | implementation | Statement | A | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 1200 | |
| 1843 | Spyke Chatting | implementation | Statement | B | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 1300 | |
| 2676 | Jeopardy! | greedy math | Statement | C | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 1400 | |
| 848 | Maze 2D | data structures divide and conquer | Statement | E | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 2100 | |
| 908 | 2048 | bitmasks dp | Statement | D | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 2100 | |
| 10554 | Mashmokh and Numbers | constructive algorithms number theory | Statement | A | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 29082 | Mashmokh and ACM | combinatorics dp number theory | Statement | B | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 748 | Mashmokh and Water Tanks | binary search data structures greedy trees two pointers | Statement | D | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 2300 | |
| 2357 | Mashmokh and Reverse Operation | combinatorics divide and conquer | Statement | C | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 2400 | |
| 211 | Mashmokh's Designed Problem | data structures | Statement | E | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 3100 | |
| 6685 | Mashmokh and Tokens | binary search greedy implementation math | Statement | B | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 9584 | Mashmokh and Lights | implementation | Statement | A | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 900 | |
| 9345 | Art Union | brute force dp implementation | Statement | B | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1300 | |
| 10003 | Guess a number! | greedy implementation two pointers | Statement | A | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1400 | |
| 8694 | Booking System | binary search dp greedy implementation | Statement | C | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1600 | |
| 1090 | Population Size | greedy implementation math | Statement | D | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2300 | |
| 1798 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2400 | |
| 2021 | Crash | implementation | Statement | B | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1400 | |
| 5049 | Football | constructive algorithms graphs implementation | Statement | C | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 3408 | Elimination | dp implementation math | Statement | A | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 2909 | Cunning Gena | bitmasks dp greedy sortings | Statement | D | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | 2000 | ||
| 929 | Square Table | constructive algorithms math probabilities | Statement | E | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2400 | |
| 546 | Big Problems for Organizers | data structures graphs trees | Statement | D | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2700 | |
| 351 | Tricky Password | data structures | Statement | E | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 3100 | |
| 7026 | Start Up | implementation | Statement | A | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1100 | |
| 1170 | Online Meeting | implementation | Statement | B | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1800 | |
| 1393 | Bug in Code | data structures graphs implementation two pointers | Statement | C | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1900 | |
| 266 | Playing the ball | geometry | Statement | E | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2500 | |
| 997 | Cup Trick | data structures | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2500 | |
| 694 | Bug in Code | binary search data structures sortings | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 2) {421} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2100 | |
| 6879 | Pasha and Hamsters | constructive algorithms implementation | Statement | A | Coder-Strike 2014 - Finals (online edition, Div. 2) {421} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 800 | |
| 9173 | Squats | implementation | Statement | A | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1000 | |
| 8459 | Megacity | binary search greedy implementation sortings | Statement | B | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1200 | |
| 5944 | Magic Formulas | math | Statement | C | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1600 | |
| 608 | 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 | |
| 149 | Colored Jenga | dfs and similar dp probabilities | Statement | E | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2500 | |
| 4155 | Sereja and Swaps | brute force sortings | Statement | A | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 1600 | |
| 1628 | Sereja and Squares | binary search data structures hashing | Statement | D | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2300 | |
| 982 | Sereja and Two Sequences | data structures dp | Statement | C | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 1411 | Sereja and Table | bitmasks greedy | Statement | B | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 803 | Sereja and Sets | dp | Statement | E | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2500 | |
| 3958 | Sereja and Mirroring | implementation | Statement | B | Codeforces Round 243 (Div. 2) {426} | PROGRAMMING | Codeforces Round #243 tutorial | 1300 | |
| 9940 | Sereja and Mugs | implementation | Statement | A | Codeforces Round 243 (Div. 2) {426} | PROGRAMMING | Codeforces Round #243 tutorial | 800 | |
| 15503 | Prison Transfer | data structures implementation | Statement | B | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 1100 | |
| 16821 | Checkposts | dfs and similar graphs two pointers | Statement | C | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 1700 | |
| 1608 | Police Patrol | greedy implementation math ternary search | Statement | E | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 2000 | |
| 2419 | Match & Catch | dp string suffix structures strings | Statement | D | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 2000 | |
| 96905 | Police Recruits | implementation | Statement | A | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 800 | |
| 12229 | Xor-tree | dfs and similar trees | Statement | A | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 1500 | |
| 10185 | Working out | dp | Statement | B | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 1800 | |
| 3227 | Tricky Function | data structures divide and conquer geometry | Statement | D | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2100 | |
| 1030 | Guess the Tree | bitmasks constructive algorithms dp greedy trees | Statement | C | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2400 | |
| 977 | Points and Segments | graphs | Statement | E | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2900 | |
| 4114 | Balls Game | brute force two pointers | Statement | B | Codeforces Round 245 (Div. 2) {430} | PROGRAMMING | Codeforces Round #245 — Editorial | 1400 | |
| 2405 | Points and Segments (easy) | constructive algorithms sortings | Statement | A | Codeforces Round 245 (Div. 2) {430} | PROGRAMMING | Codeforces Round #245 — Editorial | 1600 | |
| 11660 | Shower Line | brute force implementation | Statement | B | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 1200 | |
| 29677 | k-Tree | dp implementation trees | Statement | C | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 1600 | |
| 2873 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 1185 | Chemistry Experiment | binary search data structures ternary search | Statement | E | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2500 | |
| 65735 | Black Square | implementation | Statement | A | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 700 | |
| 12254 | Football Kit | brute force greedy implementation | Statement | B | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 1200 | |
| 2674 | Prime Swaps | greedy sortings | Statement | C | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 1800 | |
| 11849 | 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 | |
| 791 | Square Tiling | constructive algorithms greedy | Statement | E | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 2700 | |
| 69309 | Choosing Teams | greedy implementation sortings | Statement | A | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 900 | |
| 53492 | Kuriyama Mirai's Stones | dp implementation sortings | Statement | B | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1200 | |
| 17876 | Kitahara Haruki's Gift | brute force implementation | Statement | A | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1200 | |
| 2619 | Ryouko's Memory Note | implementation math sortings | Statement | C | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1900 | |
| 1317 | Nanami's Digital Board | dsu implementation | Statement | D | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 2300 | |
| 532 | Tachibana Kanade's Tofu | dp | Statement | E | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 2500 | |
| 518 | Nanami's Power Plant | flows | Statement | D | Codeforces Round 248 (Div. 1) {434} | PROGRAMMING | Codeforces Round #248 Editorial | 2800 | |
| 311 | Furukawa Nagisa's Tree | binary search divide and conquer sortings trees | Statement | E | Codeforces Round 248 (Div. 1) {434} | PROGRAMMING | Codeforces Round #248 Editorial | 3000 | |
| 11050 | Queue on Bus Stop | implementation | Statement | A | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1100 | |
| 7554 | Pasha Maximizes | greedy | Statement | B | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1500 | |
| 2724 | Cardiogram | implementation | Statement | C | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1600 | |
| 788 | Special Grid | brute force dp greedy | Statement | D | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 2200 | |
| 259 | Special Graph | Statement | E | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 2500 | ||
| 3147 | Om Nom and Spiders | implementation math | Statement | B | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1400 | |
| 3785 | Feed with Candy | greedy | Statement | A | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1500 | |
| 2883 | Dungeons and Candies | dsu graphs greedy trees | Statement | C | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1800 | |
| 1821 | Cardboard Box | data structures greedy | Statement | E | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2500 | |
| 352 | Pudding Monsters | dp | Statement | D | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2700 | |
| 457 | Banners | brute force data structures dp | Statement | F | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2900 | |
| 9355 | The Child and Homework | implementation | Statement | A | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1400 | |
| 10430 | The Child and Set | bitmasks greedy implementation sortings | Statement | B | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1500 | |
| 14982 | The Child and Toy | graphs greedy sortings | Statement | C | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1600 | |
| 3666 | The Child and Zoo | dsu sortings | Statement | D | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 2100 | |
| 786 | The Child and Polygon | dp geometry | Statement | E | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 2600 | |
| 11514 | The Child and Sequence | data structures math | Statement | D | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 2300 | |
| 2127 | The Child and Binary Tree | combinatorics divide and conquer fft number theory | Statement | E | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 3100 | |
| 26606 | Devu, the Singer and Churu, the Joker | greedy implementation | Statement | A | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1100 | |
| 15014 | Devu, the Dumb Guy | implementation sortings | Statement | B | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1200 | |
| 4170 | Devu and Partitioning of the Array | brute force constructive algorithms implementation number theory | Statement | C | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1700 | |
| 6832 | Devu and his Brother | binary search sortings ternary search two pointers | Statement | D | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1900 | |
| 1836 | Devu and Birthday Celebration | combinatorics dp math | Statement | E | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 2600 | |
| 8890 | Forgotten Episode | implementation | Statement | A | Testing Round 10 {440} | PROGRAMMING | 1000 | ||
| 2325 | Balancer | greedy implementation | Statement | B | Testing Round 10 {440} | PROGRAMMING | 1600 | ||
| 1139 | One-Based Arithmetic | brute force dfs and similar divide and conquer | Statement | C | Testing Round 10 {440} | PROGRAMMING | 2000 | ||
| 940 | Berland Federalization | dp trees | Statement | D | Testing Round 10 {440} | PROGRAMMING | 2600 | ||
| 19286 | Valera and Antique Items | implementation | Statement | A | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 1000 | |
| 7506 | Valera and Fruits | greedy implementation | Statement | B | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 12615 | 1400 | |
| 11913 | Valera and Tubes | constructive algorithms dfs and similar implementation | Statement | C | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 12615 | 1500 | |
| 1199 | Valera and Swaps | constructive algorithms dsu graphs implementation math string suffix structures | Statement | D | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 2300 | |
| 815 | Valera and Number | bitmasks dp math probabilities | Statement | E | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 2700 | |
| 6098 | Andrey and Problem | greedy math probabilities | Statement | B | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 1800 | |
| 2352 | Borya and Hanabi | bitmasks brute force implementation | Statement | A | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2000 | |
| 1949 | Artem and Array | data structures greedy | Statement | C | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 1131 | Adam and Tree | data structures trees | Statement | D | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 195 | Gena and Second Distance | geometry | Statement | E | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 3100 | |
| 4270 | Kolya and Tandem Repeat | brute force implementation strings | Statement | B | Codeforces Round 253 (Div. 2) {443} | PROGRAMMING | Codeforces #253 editorial | 1500 | |
| 111552 | Anton and Letters | constructive algorithms implementation | Statement | A | Codeforces Round 253 (Div. 2) {443} | PROGRAMMING | Codeforces #253 editorial | 800 | |
| 3577 | DZY Loves Physics | greedy math | Statement | A | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 1800 | |
| 3355 | DZY Loves Colors | data structures | Statement | C | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2300 | |
| 861 | DZY Loves Strings | binary search hashing strings two pointers | Statement | D | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2400 | |
| 1171 | DZY Loves FFT | probabilities | Statement | B | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2400 | |
| 856 | DZY Loves Planting | binary search dsu trees | Statement | E | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2600 | |
| 33583 | DZY Loves Chessboard | dfs and similar implementation | Statement | A | Codeforces Round 254 (Div. 2) {445} | PROGRAMMING | Codeforces Round #254 Editorial | 1200 | |
| 14718 | DZY Loves Chemistry | dfs and similar dsu greedy | Statement | B | Codeforces Round 254 (Div. 2) {445} | PROGRAMMING | Codeforces Round #254 Editorial | 1500 | |
| 13517 | DZY Loves Sequences | dp implementation two pointers | Statement | A | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1700 | |
| 3855 | DZY Loves Modification | brute force data structures greedy | Statement | B | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2100 | |
| 3922 | DZY Loves Fibonacci Numbers | data structures math number theory | Statement | C | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2600 | |
| 464 | DZY Loves Games | math matrices probabilities | Statement | D | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2800 | |
| 143 | DZY Loves Bridges | math matrices | Statement | E | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 3100 | |
| 21018 | DZY Loves Strings | greedy implementation | Statement | B | Codeforces Round #FF (Div. 2) {447} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1000 | |
| 10263 | DZY Loves Hash | implementation | Statement | A | Codeforces Round #FF (Div. 2) {447} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 900 | |
| 17303 | Suffix Structures | implementation strings | Statement | B | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1400 | |
| 10767 | Painting Fence | divide and conquer dp greedy | Statement | C | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Codeforces Round #256 — Разбор | 1900 | |
| 16616 | Multiplication Table | binary search brute force | Statement | D | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1900 | |
| 1635 | Divisors | brute force dfs and similar implementation number theory | Statement | E | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Codeforces Round #256 — Разбор | 2500 | |
| 25853 | Rewards | implementation | Statement | A | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 900 | |
| 4125 | Jzzhu and Chocolate | greedy math | Statement | A | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 1700 | |
| 10553 | Jzzhu and Cities | graphs greedy shortest paths | Statement | B | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2000 | |
| 6122 | Jzzhu and Numbers | bitmasks combinatorics dp | Statement | D | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2400 | |
| 2526 | Jzzhu and Apples | constructive algorithms number theory | Statement | C | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2500 | |
| 305 | Jzzhu and Squares | dp math number theory | Statement | E | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2900 | |
| 43742 | Jzzhu and Children | implementation | Statement | A | Codeforces Round 257 (Div. 2) {450} | PROGRAMMING | Codeforces Round #257 Editorial | 1000 | |
| 28790 | Jzzhu and Sequences | implementation math | Statement | B | Codeforces Round 257 (Div. 2) {450} | PROGRAMMING | Codeforces Round #257 Editorial | 1400 | |
| 75511 | Game With Sticks | implementation | Statement | A | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1000 | |
| 52715 | Sort the Array | implementation sortings | Statement | B | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1300 | |
| 3578 | Predict Outcome of the Game | brute force implementation math | Statement | C | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1700 | |
| 5058 | Count Good Substrings | math | Statement | D | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 2100 | |
| 4507 | Devu and Flowers | bitmasks combinatorics number theory | Statement | E | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 2400 | |
| 8510 | Eevee | brute force implementation strings | Statement | A | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1200 | |
| 2106 | 4-point polyline | brute force constructive algorithms geometry trees | Statement | B | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1800 | |
| 1666 | Washer, Dryer, Folder | greedy implementation | Statement | D | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1900 | |
| 1750 | Magic Trick | combinatorics math probabilities | Statement | C | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2100 | |
| 1197 | Three strings | data structures dsu string suffix structures strings | Statement | E | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2400 | |
| 1794 | Permutation | data structures divide and conquer hashing | Statement | F | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2600 | |
| 12398 | Little Pony and Expected Maximum | probabilities | Statement | A | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 1600 | |
| 5385 | Little Pony and Harmony Chest | bitmasks brute force dp | Statement | B | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2200 | |
| 1741 | Little Pony and Summer Sun Celebration | constructive algorithms dfs and similar graphs | Statement | C | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2800 | |
| 576 | Little Pony and Elements of Harmony | dp matrices | Statement | D | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2900 | |
| 909 | Little Pony and Lord Tirek | data structures | Statement | E | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 3000 | |
| 19155 | Little Pony and Sort by Shift | implementation | Statement | B | Codeforces Round 259 (Div. 2) {454} | PROGRAMMING | Codeforces Round #259 Editorial | 1300 | |
| 16108 | Little Pony and Crystal Mine | implementation | Statement | A | Codeforces Round 259 (Div. 2) {454} | PROGRAMMING | Codeforces Round #259 Editorial | 800 | |
| 71597 | Boredom | dp | Statement | A | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 1600 | |
| 6819 | 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 | |
| 6456 | Civilization | dfs and similar dp dsu ternary search trees | Statement | C | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2200 | |
| 3644 | Serega and Fun | data structures | Statement | D | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2600 | |
| 785 | Function | data structures | Statement | E | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2800 | |
| 56566 | Laptops | sortings | Statement | A | Codeforces Round 260 (Div. 2) {456} | PROGRAMMING | Разбор задач | 1200 | |
| 18531 | Fedya and Maths | math number theory | Statement | B | Codeforces Round 260 (Div. 2) {456} | PROGRAMMING | Codeforces Round #260 — Editorial | 1200 | |
| 1375 | Golden System | math meet-in-the-middle | Statement | A | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1800 | |
| 1210 | Distributed Join | greedy | Statement | B | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1900 | |
| 945 | Elections | brute force | Statement | C | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2100 | |
| 389 | Bingo! | combinatorics math probabilities | Statement | D | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2700 | |
| 126 | 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 | |
| 121 | Flow Optimality | constructive algorithms flows math | Statement | E | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 3200 | |
| 36355 | Pashmak and Garden | implementation | Statement | A | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1300 | |
| 47386 | Pashmak and Flowers | combinatorics implementation sortings | Statement | B | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1300 | |
| 12749 | Pashmak and Parmida's problem | data structures divide and conquer sortings | Statement | D | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1800 | |
| 6481 | Pashmak and Buses | combinatorics constructive algorithms math | Statement | C | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1900 | |
| 5968 | Pashmak and Graph | dp sortings | Statement | E | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 2100 | |
| 51938 | Vasya and Socks | brute force implementation math | Statement | A | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1000 | |
| 13362 | Little Dima and Equation | brute force implementation math number theory | Statement | B | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1500 | |
| 6760 | Present | binary search data structures greedy | Statement | C | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1900 | |
| 1036 | Little Victor and Set | brute force constructive algorithms math | Statement | D | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 2500 | |
| 382 | Roland and Rose | brute force geometry math sortings | Statement | E | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 2700 | |
| 16430 | Appleman and Toastman | greedy sortings | Statement | A | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 1200 | |
| 6997 | Appleman and Tree | dfs and similar dp trees | Statement | B | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2200 | |
| 1392 | Appleman and a Sheet of Paper | data structures implementation | Statement | C | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2500 | |
| 401 | Appleman and Complicated Task | dsu math | Statement | D | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2700 | |
| 516 | Appleman and a Game | binary search shortest paths strings | Statement | E | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 3000 | |
| 17859 | Appleman and Easy Task | brute force implementation | Statement | A | Codeforces Round 263 (Div. 2) {462} | PROGRAMMING | Tutorial | 1100 | |
| 15550 | Appleman and Card Game | greedy | Statement | B | Codeforces Round 263 (Div. 2) {462} | PROGRAMMING | Tutorial | 1300 | |
| 29933 | Caisa and Pylons | brute force implementation math | Statement | B | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1200 | |
| 9558 | Caisa and Sugar | brute force implementation | Statement | A | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1300 | |
| 9169 | Gargari and Bishops | greedy hashing implementation | Statement | C | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1800 | |
| 7285 | Gargari and Permutations | dfs and similar dp graphs implementation | Statement | D | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2000 | |
| 1741 | Caisa and Tree | brute force dfs and similar math number theory trees | Statement | E | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2400 |