Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 17 18 19 20 21 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 524 | On a plane | *special | Statement | G | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2600 | |
| 128 | Feed the Golorp | *special | Statement | I | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2900 | |
| 7366 | Password Check | implementation | Statement | A | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | Coder-Strike 2014: Qualification Round (Tutorial) | 1800 | |
| 1289 | Multi-core Processor | implementation | Statement | B | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | 2000 | ||
| 1233 | Kicker | implementation | Statement | C | Coder-Strike 2014 - Qualification Round {411} | PROGRAMMING | 2100 | ||
| 4523 | Poster | greedy implementation | Statement | A | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | 1000 | ||
| 5573 | Network Configuration | greedy sortings | Statement | B | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | 1000 | ||
| 3962 | Pattern | implementation strings | Statement | C | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | 1300 | ||
| 852 | E-mail Addresses | implementation | Statement | E | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | 1800 | ||
| 2099 | Giving Awards | dfs and similar | Statement | D | Coder-Strike 2014 - Round 1 {412} | PROGRAMMING | 1900 | ||
| 2694 | Data Recovery | implementation | Statement | A | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | 1200 | ||
| 1730 | Spyke Chatting | implementation | Statement | B | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | 1300 | ||
| 2396 | Jeopardy! | greedy math | Statement | C | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | 1400 | ||
| 756 | Maze 2D | data structures divide and conquer | Statement | E | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | 2100 | ||
| 830 | 2048 | bitmasks dp | Statement | D | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | 2100 | ||
| 9896 | Mashmokh and Numbers | constructive algorithms number theory | Statement | A | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 23325 | Mashmokh and ACM | combinatorics dp number theory | Statement | B | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 692 | Mashmokh and Water Tanks | binary search data structures greedy trees two pointers | Statement | D | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | 2300 | ||
| 2246 | Mashmokh and Reverse Operation | combinatorics divide and conquer | Statement | C | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | 2400 | ||
| 200 | Mashmokh's Designed Problem | data structures | Statement | E | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 3100 | |
| 6364 | Mashmokh and Tokens | binary search greedy implementation math | Statement | B | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 1500 | |
| 9082 | Mashmokh and Lights | implementation | Statement | A | Codeforces Round 240 (Div. 2) {415} | PROGRAMMING | Codeforces Round #240 Editorial | 900 | |
| 8821 | Art Union | brute force dp implementation | Statement | B | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1300 | |
| 9055 | Guess a number! | greedy implementation two pointers | Statement | A | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | Codeforces Round #241 — editorial | 1400 | |
| 8122 | Booking System | binary search dp greedy implementation | Statement | C | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | 1600 | ||
| 964 | Population Size | greedy implementation math | Statement | D | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | 2300 | ||
| 1564 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | 2400 | ||
| 1849 | Crash | implementation | Statement | B | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1400 | |
| 4713 | Football | constructive algorithms graphs implementation | Statement | C | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 3070 | Elimination | dp implementation math | Statement | A | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 1500 | |
| 2568 | Cunning Gena | bitmasks dp greedy sortings | Statement | D | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | 2000 | ||
| 856 | Square Table | constructive algorithms math probabilities | Statement | E | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2400 | |
| 489 | Big Problems for Organizers | data structures graphs trees | Statement | D | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2700 | |
| 327 | Tricky Password | data structures | Statement | E | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 3100 | |
| 6320 | Start Up | implementation | Statement | A | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1100 | |
| 1050 | Online Meeting | implementation | Statement | B | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1800 | |
| 1274 | 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 | |
| 224 | Playing the ball | geometry | Statement | E | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | 2500 | ||
| 865 | Cup Trick | data structures | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2500 | |
| 549 | 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 | |
| 6308 | Pasha and Hamsters | constructive algorithms implementation | Statement | A | Coder-Strike 2014 - Finals (online edition, Div. 2) {421} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 800 | |
| 8578 | Squats | implementation | Statement | A | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1000 | |
| 7838 | Megacity | binary search greedy implementation sortings | Statement | B | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1200 | |
| 5527 | Magic Formulas | math | Statement | C | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 1600 | |
| 570 | Biathlon Track | binary search brute force constructive algorithms data structures dp | Statement | D | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | 2200 | ||
| 135 | Colored Jenga | dfs and similar dp probabilities | Statement | E | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2500 | |
| 3930 | Sereja and Swaps | brute force sortings | Statement | A | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 1600 | |
| 1479 | Sereja and Squares | binary search data structures hashing | Statement | D | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2300 | |
| 910 | Sereja and Two Sequences | data structures dp | Statement | C | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 1327 | Sereja and Table | bitmasks greedy | Statement | B | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 693 | Sereja and Sets | dp | Statement | E | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2500 | |
| 3830 | Sereja and Mirroring | implementation | Statement | B | Codeforces Round 243 (Div. 2) {426} | PROGRAMMING | Codeforces Round #243 tutorial | 1300 | |
| 9297 | Sereja and Mugs | implementation | Statement | A | Codeforces Round 243 (Div. 2) {426} | PROGRAMMING | Codeforces Round #243 tutorial | 800 | |
| 14202 | Prison Transfer | data structures implementation | Statement | B | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 1100 | |
| 14449 | Checkposts | dfs and similar graphs two pointers | Statement | C | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | 1700 | ||
| 1451 | Police Patrol | greedy implementation math ternary search | Statement | E | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | 2000 | ||
| 2234 | Match & Catch | dp string suffix structures strings | Statement | D | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 2000 | |
| 81395 | Police Recruits | implementation | Statement | A | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 800 | |
| 10521 | Xor-tree | dfs and similar trees | Statement | A | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 1500 | |
| 8960 | Working out | dp | Statement | B | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | 1800 | ||
| 2968 | Tricky Function | data structures divide and conquer geometry | Statement | D | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2100 | |
| 967 | Guess the Tree | bitmasks constructive algorithms dp greedy trees | Statement | C | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2400 | |
| 906 | Points and Segments | graphs | Statement | E | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2900 | |
| 3760 | Balls Game | brute force two pointers | Statement | B | Codeforces Round 245 (Div. 2) {430} | PROGRAMMING | Codeforces Round #245 — Editorial | 1400 | |
| 2298 | Points and Segments (easy) | constructive algorithms sortings | Statement | A | Codeforces Round 245 (Div. 2) {430} | PROGRAMMING | Codeforces Round #245 — Editorial | 1600 | |
| 10955 | Shower Line | brute force implementation | Statement | B | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | 1200 | ||
| 26281 | k-Tree | dp implementation trees | Statement | C | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 1600 | |
| 2444 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 1049 | Chemistry Experiment | binary search data structures ternary search | Statement | E | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2500 | |
| 56775 | Black Square | implementation | Statement | A | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 700 | |
| 11780 | Football Kit | brute force greedy implementation | Statement | B | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 1200 | |
| 2548 | Prime Swaps | greedy sortings | Statement | C | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 1800 | |
| 9452 | 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 | |
| 720 | Square Tiling | constructive algorithms greedy | Statement | E | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 2700 | |
| 61874 | Choosing Teams | greedy implementation sortings | Statement | A | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 900 | |
| 41728 | Kuriyama Mirai's Stones | dp implementation sortings | Statement | B | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1200 | |
| 16631 | Kitahara Haruki's Gift | brute force implementation | Statement | A | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | Codeforces Round #248 Editorial | 1200 | |
| 2506 | Ryouko's Memory Note | implementation math sortings | Statement | C | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | 1900 | ||
| 1249 | Nanami's Digital Board | ds implementation | Statement | D | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | 2300 | ||
| 492 | Tachibana Kanade's Tofu | dp | Statement | E | Codeforces Round 248 (Div. 2) {433} | PROGRAMMING | 2500 | ||
| 478 | Nanami's Power Plant | flows | Statement | D | Codeforces Round 248 (Div. 1) {434} | PROGRAMMING | 2800 | ||
| 301 | Furukawa Nagisa's Tree | binary search divide and conquer sortings trees | Statement | E | Codeforces Round 248 (Div. 1) {434} | PROGRAMMING | 3000 | ||
| 10270 | Queue on Bus Stop | implementation | Statement | A | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1100 | |
| 7097 | Pasha Maximizes | greedy | Statement | B | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1500 | |
| 2587 | Cardiogram | implementation | Statement | C | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 1600 | |
| 763 | Special Grid | brute force dp greedy | Statement | D | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | Codeforces Round #249 (Div. 2) Editorial | 2200 | |
| 246 | Special Graph | Statement | E | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | 2500 | |||
| 3069 | Om Nom and Spiders | implementation math | Statement | B | Zepto Code Rush 2014 {436} | PROGRAMMING | 1400 | ||
| 3542 | Feed with Candy | greedy | Statement | A | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 1500 | |
| 2689 | Dungeons and Candies | ds graphs greedy trees | Statement | C | Zepto Code Rush 2014 {436} | PROGRAMMING | 1800 | ||
| 1424 | Cardboard Box | data structures greedy | Statement | E | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2500 | |
| 326 | Pudding Monsters | dp | Statement | D | Zepto Code Rush 2014 {436} | PROGRAMMING | 2700 | ||
| 403 | Banners | brute force data structures dp | Statement | F | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2900 | |
| 9077 | The Child and Homework | implementation | Statement | A | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1400 | |
| 9671 | The Child and Set | bitmasks greedy implementation sortings | Statement | B | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1500 | |
| 14114 | The Child and Toy | graphs greedy sortings | Statement | C | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1600 | |
| 3440 | The Child and Zoo | ds sortings | Statement | D | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 2100 | ||
| 709 | The Child and Polygon | dp geometry | Statement | E | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 2600 | |
| 9022 | The Child and Sequence | data structures math | Statement | D | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 2300 | |
| 1913 | The Child and Binary Tree | combinatorics divide and conquer fft number theory | Statement | E | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 3100 |