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 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 222 | 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 | ||
| 1220 | Painting The Wall | dp probabilities | Statement | B | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | |
| 1357 | Instant Messanger | data structures | Statement | D | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 2000.0 | Codeforces Round #233 Editorial | |
| 967 | Cards | constructive algorithms implementation | Statement | A | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 500.0 | Codeforces Round #233 Editorial | |
| 1924 | Red and Blue Balls | Statement | B | Codeforces Round 233 (Div. 2) {399} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | ||
| 4246 | Pages | implementation | Statement | A | Codeforces Round 233 (Div. 2) {399} | PROGRAMMING | 500.0 | Codeforces Round #233 Editorial | |
| 6955 | Inna and Choose Options | implementation | Statement | A | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 1000 | |
| 8702 | 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 | |
| 3035 | Inna and Huge Candy Matrix | implementation math | Statement | C | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 1500 | |
| 3291 | Dima and Bacteria | dsu graphs shortest paths | Statement | D | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2000 | |
| 1078 | 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 | |
| 4643 | Sereja and Contests | greedy implementation math | Statement | B | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 1200 | |
| 22057 | Team | constructive algorithms greedy implementation | Statement | C | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 1400 | |
| 4794 | 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 | |
| 17592 | Vanya and Cards | implementation math | Statement | A | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 900 | |
| 4926 | Nuts | greedy math | Statement | A | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1200 | |
| 4014 | Trees in a Row | brute force implementation | Statement | B | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1400 | |
| 6454 | Searching for Graph | brute force constructive algorithms graphs | Statement | C | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1500 | |
| 2815 | Upgrading Array | dp greedy math number theory | Statement | D | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2000 | |
| 2373 | Strictly Positive Matrix | graphs math | Statement | E | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 1261 | Beautiful Pairs of Numbers | combinatorics dp | Statement | D | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 280 | Two Rooted Trees | data structures implementation trees | Statement | E | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | Editorial Codeforces Round #236 | 2900 | |
| 26508 | Valera and X | implementation | Statement | A | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1100 | |
| 3066 | Marathon | implementation math | Statement | B | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1500 | |
| 5888 | Restore Graph | dfs and similar graphs sortings | Statement | C | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1800 | |
| 2504 | Minesweeper 1D | dp implementation | Statement | D | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2200 | |
| 666 | Maze 1D | binary search greedy implementation | Statement | E | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2700 | |
| 131343 | Gravity Flip | greedy implementation sortings | Statement | A | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1000 | |
| 6154 | Domino Effect | Statement | B | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1200 | ||
| 4977 | Unusual Product | implementation math | Statement | C | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1600 | |
| 3302 | Toy Sum | greedy implementation math | Statement | D | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1900 | |
| 1667 | Graph Cutting | dfs and similar graphs | Statement | E | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 2400 | |
| 1326 | Hill Climbing | dfs and similar geometry trees | Statement | D | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2200 | |
| 407 | Hamming Triples | implementation math two pointers | Statement | E | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2700 | |
| 5219 | Triangle | brute force geometry implementation math | Statement | A | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 1700 | |
| 7249 | Long Path | dp implementation | Statement | B | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 1800 | |
| 1259 | Curious Array | brute force combinatorics implementation math | Statement | C | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 2500 | |
| 847 | Largest Submatrix 3 | dp hashing | Statement | D | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 2600 | |
| 1372 | k-d-sequence | data structures | Statement | E | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 3100 | |
| 10471 | Garland | implementation | Statement | B | Codeforces Round 239 (Div. 2) {408} | PROGRAMMING | Codeforces Round #239 Editorial | 1200 | |
| 12148 | Line to Cashier | implementation | Statement | A | Codeforces Round 239 (Div. 2) {408} | PROGRAMMING | Codeforces Round #239 Editorial | 900 | |
| 2642 | The Great Game | *special | Statement | A | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 2149 | Magnum Opus | *special | Statement | C | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 9599 | 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 | |
| 1436 | Mysterious Language | *special | Statement | B | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1800 | |
| 1814 | Big Data | *special | Statement | D | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2000 | |
| 622 | Dome | *special | Statement | E | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2100 | |
| 2189 | 000001 | *special | Statement | F | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2300 | |
| 576 | On a plane | *special | Statement | G | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2600 | |
| 169 | Feed the Golorp | *special | Statement | I | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2900 | |
| 8234 | Password Check | implementation | Statement | A | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | Coder-Strike 2014: Qualification Round (Tutorial) | 1800 | |
| 1428 | Multi-core Processor | implementation | Statement | B | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | Coder-Strike 2014: Qualification Round (Tutorial) | 2000 | |
| 1306 | Kicker | implementation | Statement | C | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | Coder-Strike 2014: Qualification Round (Tutorial) | 2100 | |
| 5095 | Poster | greedy implementation | Statement | A | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1000 | |
| 6518 | Network Configuration | greedy sortings | Statement | B | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1000 | |
| 4276 | Pattern | implementation strings | Statement | C | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1300 | |
| 949 | E-mail Addresses | implementation | Statement | E | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1800 | |
| 2526 | Giving Awards | dfs and similar | Statement | D | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 1 | 1900 | |
| 3044 | Data Recovery | implementation | Statement | A | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 1200 | |
| 1868 | Spyke Chatting | implementation | Statement | B | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 1300 | |
| 2704 | Jeopardy! | greedy math | Statement | C | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 1400 | |
| 881 | Maze 2D | data structures divide and conquer | Statement | E | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 2100 | |
| 944 | 2048 | bitmasks dp | Statement | D | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 2100 | |
| 10641 | Mashmokh and Numbers | constructive algorithms number theory | Statement | A | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 30962 | Mashmokh and ACM | combinatorics dp number theory | Statement | B | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 783 | 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 | |
| 2416 | Mashmokh and Reverse Operation | combinatorics divide and conquer | Statement | C | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 2400 | |
| 267 | Mashmokh's Designed Problem | data structures | Statement | E | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 3100 | |
| 6742 | Mashmokh and Tokens | binary search greedy implementation math | Statement | B | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 9692 | Mashmokh and Lights | implementation | Statement | A | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 900 | |
| 9490 | Art Union | brute force dp implementation | Statement | B | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1300 | |
| 10193 | Guess a number! | greedy implementation two pointers | Statement | A | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1400 | |
| 8843 | Booking System | binary search dp greedy implementation | Statement | C | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1600 | |
| 1165 | Population Size | greedy implementation math | Statement | D | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2300 | |
| 1925 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 2400 | |
| 2049 | Crash | implementation | Statement | B | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1400 | |
| 5124 | Football | constructive algorithms graphs implementation | Statement | C | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 3449 | Elimination | dp implementation math | Statement | A | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 3017 | Cunning Gena | bitmasks dp greedy sortings | Statement | D | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | 2000 | ||
| 1004 | Square Table | constructive algorithms math probabilities | Statement | E | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2400 | |
| 591 | Big Problems for Organizers | data structures graphs trees | Statement | D | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2700 | |
| 468 | Tricky Password | data structures | Statement | E | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 3100 | |
| 7207 | Start Up | implementation | Statement | A | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1100 | |
| 1179 | Online Meeting | implementation | Statement | B | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1800 | |
| 1437 | 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 | |
| 329 | Playing the ball | geometry | Statement | E | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2500 | |
| 1039 | Cup Trick | data structures | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2500 | |
| 730 | 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 | |
| 6985 | Pasha and Hamsters | constructive algorithms implementation | Statement | A | Coder-Strike 2014 - Finals (online edition, Div. 2) {421} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 800 | |
| 9378 | Squats | implementation | Statement | A | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1000 | |
| 8535 | Megacity | binary search greedy implementation sortings | Statement | B | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1200 | |
| 6033 | Magic Formulas | math | Statement | C | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1600 | |
| 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 | |
| 4202 | Sereja and Swaps | brute force sortings | Statement | A | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 1600 | |
| 1679 | Sereja and Squares | binary search data structures hashing | Statement | D | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2300 | |
| 1025 | Sereja and Two Sequences | data structures dp | Statement | C | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 1450 | Sereja and Table | bitmasks greedy | Statement | B | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 852 | Sereja and Sets | dp | Statement | E | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2500 | |
| 3985 | Sereja and Mirroring | implementation | Statement | B | Codeforces Round 243 (Div. 2) {426} | PROGRAMMING | Codeforces Round #243 tutorial | 1300 | |
| 10095 | Sereja and Mugs | implementation | Statement | A | Codeforces Round 243 (Div. 2) {426} | PROGRAMMING | Codeforces Round #243 tutorial | 800 | |
| 15633 | Prison Transfer | data structures implementation | Statement | B | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 1100 | |
| 17861 | Checkposts | dfs and similar graphs two pointers | Statement | C | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 1700 | |
| 1671 | Police Patrol | greedy implementation math ternary search | Statement | E | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 2000 | |
| 2754 | Match & Catch | dp string suffix structures strings | Statement | D | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 2000 | |
| 100871 | Police Recruits | implementation | Statement | A | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 800 | |
| 12514 | Xor-tree | dfs and similar trees | Statement | A | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 1500 | |
| 10580 | Working out | dp | Statement | B | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 1800 | |
| 3283 | Tricky Function | data structures divide and conquer geometry | Statement | D | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2100 | |
| 1064 | Guess the Tree | bitmasks constructive algorithms dp greedy trees | Statement | C | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2400 | |
| 1048 | Points and Segments | graphs | Statement | E | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2900 | |
| 4160 | Balls Game | brute force two pointers | Statement | B | Codeforces Round 245 (Div. 2) {430} | PROGRAMMING | Codeforces Round #245 — Editorial | 1400 | |
| 2433 | Points and Segments (easy) | constructive algorithms sortings | Statement | A | Codeforces Round 245 (Div. 2) {430} | PROGRAMMING | Codeforces Round #245 — Editorial | 1600 | |
| 11853 | Shower Line | brute force implementation | Statement | B | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 1200 | |
| 30895 | k-Tree | dp implementation trees | Statement | C | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 1600 | |
| 2987 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 1229 | Chemistry Experiment | binary search data structures ternary search | Statement | E | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2500 | |
| 68102 | Black Square | implementation | Statement | A | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 700 | |
| 12340 | Football Kit | brute force greedy implementation | Statement | B | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 1200 | |
| 2698 | Prime Swaps | greedy sortings | Statement | C | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 1800 | |
| 12853 | 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 | |
| 814 | Square Tiling | constructive algorithms greedy | Statement | E | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 2700 | |
| 71139 | Choosing Teams | greedy implementation sortings | Statement | A | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 900 | |
| 57218 | Kuriyama Mirai's Stones | dp implementation sortings | Statement | B | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1200 | |
| 18166 | Kitahara Haruki's Gift | brute force implementation | Statement | A | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1200 | |
| 2642 | Ryouko's Memory Note | implementation math sortings | Statement | C | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1900 | |
| 1345 | Nanami's Digital Board | dsu implementation | Statement | D | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 2300 | |
| 577 | Tachibana Kanade's Tofu | dp | Statement | E | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 2500 | |
| 614 | Nanami's Power Plant | flows | Statement | D | Codeforces Round 248 (Div. 1) {434} | PROGRAMMING | Codeforces Round #248 Editorial | 2800 | |
| 538 | 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 | |
| 11229 | Queue on Bus Stop | implementation | Statement | A | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1100 | |
| 7644 | Pasha Maximizes | greedy | Statement | B | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1500 | |
| 2759 | Cardiogram | implementation | Statement | C | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1600 | |
| 861 | Special Grid | brute force dp greedy | Statement | D | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 2200 | |
| 288 | Special Graph | Statement | E | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 2500 | ||
| 3180 | Om Nom and Spiders | implementation math | Statement | B | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1400 | |
| 3812 | Feed with Candy | greedy | Statement | A | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1500 | |
| 2949 | Dungeons and Candies | dsu graphs greedy trees | Statement | C | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1800 | |
| 2090 | Cardboard Box | data structures greedy | Statement | E | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2500 | |
| 376 | Pudding Monsters | dp | Statement | D | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2700 | |
| 610 | Banners | brute force data structures dp | Statement | F | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2900 | |
| 9458 | The Child and Homework | implementation | Statement | A | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1400 | |
| 10573 | The Child and Set | bitmasks greedy implementation sortings | Statement | B | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1500 | |
| 15158 | The Child and Toy | graphs greedy sortings | Statement | C | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1600 | |
| 3746 | The Child and Zoo | dsu sortings | Statement | D | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 2100 | |
| 873 | The Child and Polygon | dp geometry | Statement | E | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 2600 | |
| 12589 | The Child and Sequence | data structures math | Statement | D | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 2300 | |
| 2380 | The Child and Binary Tree | combinatorics divide and conquer fft number theory | Statement | E | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 3100 | |
| 26806 | Devu, the Singer and Churu, the Joker | greedy implementation | Statement | A | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1100 | |
| 15110 | Devu, the Dumb Guy | implementation sortings | Statement | B | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1200 | |
| 4197 | 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 | |
| 7265 | 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 | |
| 1931 | Devu and Birthday Celebration | combinatorics dp math | Statement | E | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 2600 | |
| 9108 | Forgotten Episode | implementation | Statement | A | Testing Round 10 {440} | PROGRAMMING | 1000 | ||
| 2360 | Balancer | greedy implementation | Statement | B | Testing Round 10 {440} | PROGRAMMING | 1600 | ||
| 1155 | One-Based Arithmetic | brute force dfs and similar divide and conquer | Statement | C | Testing Round 10 {440} | PROGRAMMING | 2000 | ||
| 1018 | Berland Federalization | dp trees | Statement | D | Testing Round 10 {440} | PROGRAMMING | 2600 | ||
| 19506 | Valera and Antique Items | implementation | Statement | A | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 1000 | |
| 7570 | Valera and Fruits | greedy implementation | Statement | B | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 12615 | 1400 | |
| 12080 | Valera and Tubes | constructive algorithms dfs and similar implementation | Statement | C | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 12615 | 1500 | |
| 1269 | 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 | |
| 844 | Valera and Number | bitmasks dp math probabilities | Statement | E | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 2700 | |
| 6301 | Andrey and Problem | greedy math probabilities | Statement | B | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 1800 | |
| 2383 | Borya and Hanabi | bitmasks brute force implementation | Statement | A | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2000 | |
| 2034 | Artem and Array | data structures greedy | Statement | C | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 1265 | Adam and Tree | data structures trees | Statement | D | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 215 | Gena and Second Distance | geometry | Statement | E | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 3100 | |
| 4305 | Kolya and Tandem Repeat | brute force implementation strings | Statement | B | Codeforces Round 253 (Div. 2) {443} | PROGRAMMING | Codeforces #253 editorial | 1500 | |
| 116730 | Anton and Letters | constructive algorithms implementation | Statement | A | Codeforces Round 253 (Div. 2) {443} | PROGRAMMING | Codeforces #253 editorial | 800 | |
| 3603 | DZY Loves Physics | greedy math | Statement | A | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 1800 | |
| 3494 | DZY Loves Colors | data structures | Statement | C | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2300 | |
| 901 | DZY Loves Strings | binary search hashing strings two pointers | Statement | D | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2400 | |
| 1201 | DZY Loves FFT | probabilities | Statement | B | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2400 | |
| 919 | DZY Loves Planting | binary search dsu trees | Statement | E | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2600 | |
| 34428 | DZY Loves Chessboard | dfs and similar implementation | Statement | A | Codeforces Round 254 (Div. 2) {445} | PROGRAMMING | Codeforces Round #254 Editorial | 1200 | |
| 15531 | DZY Loves Chemistry | dfs and similar dsu greedy | Statement | B | Codeforces Round 254 (Div. 2) {445} | PROGRAMMING | Codeforces Round #254 Editorial | 1500 | |
| 13729 | DZY Loves Sequences | dp implementation two pointers | Statement | A | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1700 | |
| 3964 | DZY Loves Modification | brute force data structures greedy | Statement | B | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2100 | |
| 4104 | DZY Loves Fibonacci Numbers | data structures math number theory | Statement | C | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2600 | |
| 518 | DZY Loves Games | math matrices probabilities | Statement | D | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2800 | |
| 208 | DZY Loves Bridges | math matrices | Statement | E | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 3100 | |
| 21153 | DZY Loves Strings | greedy implementation | Statement | B | Codeforces Round #FF (Div. 2) {447} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1000 | |
| 10363 | DZY Loves Hash | implementation | Statement | A | Codeforces Round #FF (Div. 2) {447} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 900 | |
| 17729 | Suffix Structures | implementation strings | Statement | B | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1400 | |
| 11196 | Painting Fence | divide and conquer dp greedy | Statement | C | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Codeforces Round #256 — Разбор | 1900 | |
| 17339 | Multiplication Table | binary search brute force | Statement | D | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1900 | |
| 1973 | Divisors | brute force dfs and similar implementation number theory | Statement | E | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Codeforces Round #256 — Разбор | 2500 | |
| 26240 | Rewards | implementation | Statement | A | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 900 | |
| 4166 | Jzzhu and Chocolate | greedy math | Statement | A | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 1700 | |
| 11416 | Jzzhu and Cities | graphs greedy shortest paths | Statement | B | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2000 | |
| 6603 | Jzzhu and Numbers | bitmasks combinatorics dp | Statement | D | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2400 | |
| 2639 | Jzzhu and Apples | constructive algorithms number theory | Statement | C | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2500 | |
| 357 | Jzzhu and Squares | dp math number theory | Statement | E | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2900 | |
| 46900 | Jzzhu and Children | implementation | Statement | A | Codeforces Round 257 (Div. 2) {450} | PROGRAMMING | Codeforces Round #257 Editorial | 1000 | |
| 29315 | Jzzhu and Sequences | implementation math | Statement | B | Codeforces Round 257 (Div. 2) {450} | PROGRAMMING | Codeforces Round #257 Editorial | 1400 | |
| 77635 | Game With Sticks | implementation | Statement | A | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1000 | |
| 54568 | Sort the Array | implementation sortings | Statement | B | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1300 | |
| 3606 | Predict Outcome of the Game | brute force implementation math | Statement | C | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1700 | |
| 5133 | Count Good Substrings | math | Statement | D | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 2100 | |
| 4835 | Devu and Flowers | bitmasks combinatorics number theory | Statement | E | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 2400 | |
| 8597 | 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 | |
| 2130 | 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 | |
| 1670 | 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 | |
| 1848 | 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 | |
| 1243 | 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 | |
| 1880 | 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 | |
| 13095 | Little Pony and Expected Maximum | probabilities | Statement | A | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 1600 | |
| 5650 | Little Pony and Harmony Chest | bitmasks brute force dp | Statement | B | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2200 | |
| 1841 | 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 | |
| 685 | Little Pony and Elements of Harmony | dp matrices | Statement | D | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2900 | |
| 1049 | Little Pony and Lord Tirek | data structures | Statement | E | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 3000 | |
| 19289 | Little Pony and Sort by Shift | implementation | Statement | B | Codeforces Round 259 (Div. 2) {454} | PROGRAMMING | Codeforces Round #259 Editorial | 1300 | |
| 16296 | Little Pony and Crystal Mine | implementation | Statement | A | Codeforces Round 259 (Div. 2) {454} | PROGRAMMING | Codeforces Round #259 Editorial | 800 | |
| 75702 | Boredom | dp | Statement | A | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 1600 | |
| 7175 | 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 | |
| 6662 | Civilization | dfs and similar dp dsu ternary search trees | Statement | C | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2200 | |
| 3914 | Serega and Fun | data structures | Statement | D | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2600 | |
| 867 | Function | data structures | Statement | E | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2800 | |
| 58799 | Laptops | sortings | Statement | A | Codeforces Round 260 (Div. 2) {456} | PROGRAMMING | Разбор задач | 1200 | |
| 18965 | Fedya and Maths | math number theory | Statement | B | Codeforces Round 260 (Div. 2) {456} | PROGRAMMING | Codeforces Round #260 — Editorial | 1200 | |
| 1425 | 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 | |
| 1216 | 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 | |
| 980 | 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 | |
| 435 | 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 | |
| 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 | |
| 134 | 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 | |
| 37039 | Pashmak and Garden | implementation | Statement | A | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1300 | |
| 48998 | Pashmak and Flowers | combinatorics implementation sortings | Statement | B | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1300 | |
| 13949 | 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 | |
| 6528 | Pashmak and Buses | combinatorics constructive algorithms math | Statement | C | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1900 | |
| 6057 | Pashmak and Graph | dp sortings | Statement | E | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 2100 | |
| 53127 | Vasya and Socks | brute force implementation math | Statement | A | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1000 | |
| 13550 | Little Dima and Equation | brute force implementation math number theory | Statement | B | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1500 | |
| 6940 | Present | binary search data structures greedy | Statement | C | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1900 | |
| 1062 | Little Victor and Set | brute force constructive algorithms math | Statement | D | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 2500 | |
| 416 | Roland and Rose | brute force geometry math sortings | Statement | E | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 2700 | |
| 16592 | Appleman and Toastman | greedy sortings | Statement | A | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 1200 | |
| 7421 | Appleman and Tree | dfs and similar dp trees | Statement | B | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2200 | |
| 1428 | Appleman and a Sheet of Paper | data structures implementation | Statement | C | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2500 | |
| 491 | Appleman and Complicated Task | dsu math | Statement | D | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2700 | |
| 753 | Appleman and a Game | binary search shortest paths strings | Statement | E | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 3000 | |
| 17985 | Appleman and Easy Task | brute force implementation | Statement | A | Codeforces Round 263 (Div. 2) {462} | PROGRAMMING | Tutorial | 1100 | |
| 15745 | Appleman and Card Game | greedy | Statement | B | Codeforces Round 263 (Div. 2) {462} | PROGRAMMING | Tutorial | 1300 | |
| 30401 | Caisa and Pylons | brute force implementation math | Statement | B | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1200 | |
| 9632 | Caisa and Sugar | brute force implementation | Statement | A | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1300 | |
| 9285 | Gargari and Bishops | greedy hashing implementation | Statement | C | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1800 | |
| 7495 | Gargari and Permutations | dfs and similar dp graphs implementation | Statement | D | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2000 | |
| 1796 | 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 |