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 ... 39 40 41 42 43 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2711 | Game with String | implementation probabilities strings | Statement | B | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 1800 | |
| 2155 | Teodor is not a liar! | data structures dp | Statement | C | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | 2100 | ||
| 418 | Game with Tokens | data structures games implementation | Statement | D | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | 2600 | ||
| 443 | Coins Exhibition | data structures dp math | Statement | E | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | 2700 | ||
| 7188 | World Cup | constructive algorithms implementation | Statement | B | Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) {931} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 1200 | |
| 3374 | Laboratory Work | implementation math | Statement | C | Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) {931} | PROGRAMMING | 1700 | ||
| 12306 | Friends Meeting | brute force greedy implementation math | Statement | A | Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) {931} | PROGRAMMING | 800 | ||
| 8261 | Recursive Queries | binary search data structures dfs and similar | Statement | B | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 1300 | |
| 4060 | Permutation Cycle | brute force constructive algorithms | Statement | C | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 1600 | |
| 1765 | Tree | binary search dp trees | Statement | D | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2200 | |
| 2919 | Team Work | combinatorics dp math | Statement | E | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2400 | |
| 3078 | Escape Through Leaf | data structures dp geometry | Statement | F | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 2700 | ||
| 985 | Palindrome Partition | dp string suffix structures strings | Statement | G | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2900 | |
| 10350 | Palindromic Supersequence | constructive algorithms | Statement | A | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 800 | |
| 5032 | A Twisty Movement | dp | Statement | A | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 1800 | ||
| 1954 | A Determined Cleanup | math | Statement | B | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 2100 | ||
| 588 | A Colourful Prospect | geometry graphs | Statement | C | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 2400 | |
| 334 | A Creative Cutout | brute force combinatorics math | Statement | D | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 2900 | ||
| 231 | A Preponderant Reunion | constructive algorithms dp | Statement | E | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 3100 | |
| 8768 | A Prosperous Lot | constructive algorithms implementation | Statement | B | Codeforces Round 462 (Div. 2) {934} | PROGRAMMING | 57763 | 1200 | |
| 7060 | A Compatible Pair | brute force games | Statement | A | Codeforces Round 462 (Div. 2) {934} | PROGRAMMING | 57763 | 1400 | |
| 11751 | Fafa and the Gates | implementation | Statement | B | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | 1000 | ||
| 4822 | Fifa and Fafa | geometry | Statement | C | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 1700 | |
| 2653 | Fafa and Ancient Alphabet | math probabilities | Statement | D | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | 1900 | ||
| 903 | Fafa and Ancient Mathematics | dfs and similar dp trees | Statement | E | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2500 | |
| 375 | Fafa and Array | data structures greedy | Statement | F | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2800 | |
| 43908 | Fafa and his Company | brute force implementation | Statement | A | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 600 | |
| 4377 | Save Energy! | binary search implementation math | Statement | A | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 1700 | |
| 3283 | Sleepy Game | dfs and similar dp games graphs | Statement | B | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | 2100 | ||
| 1190 | Lock Puzzle | constructive algorithms implementation strings | Statement | C | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | 2500 | ||
| 334 | World of Tank | dp greedy | Statement | D | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | 3000 | ||
| 202 | Iqea | data structures dfs and similar divide and conquer ds shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 6945 | Vile Grasshoppers | brute force math number theory | Statement | B | Codeforces Round 467 (Div. 2) {937} | PROGRAMMING | Codeforces Round #467, Editorial | 1500 | |
| 15336 | Olympiad | implementation sortings | Statement | A | Codeforces Round 467 (Div. 2) {937} | PROGRAMMING | Codeforces Round #467, Editorial | 800 | |
| 8934 | Run For Your Prize | brute force greedy | Statement | B | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 1100 | |
| 3372 | Constructing Tests | binary search brute force constructive algorithms | Statement | C | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 1700 | |
| 5849 | Buy a Ticket | data structures graphs shortest paths | Statement | D | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | 2000 | ||
| 1355 | Max History | combinatorics math | Statement | E | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2300 | |
| 516 | Erasing Substrings | bitmasks dp greedy | Statement | F | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2600 | |
| 939 | Shortest Path Queries | bitmasks data structures ds graphs | Statement | G | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2900 | |
| 11583 | Word Correction | implementation | Statement | A | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 900 | |
| 10681 | Hamster Farm | implementation | Statement | B | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1100 | |
| 7425 | Love Rescue | dfs and similar ds graphs greedy strings | Statement | D | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | 1600 | ||
| 4660 | Convenient For Everybody | binary search two pointers | Statement | C | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | 1600 | ||
| 3179 | Maximize! | binary search greedy ternary search two pointers | Statement | E | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1900 | |
| 998 | Cutlet | data structures dp | Statement | F | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | 2700 | ||
| 25960 | Love Triangle | graphs | Statement | A | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 800 | |
| 8386 | Points on the line | brute force greedy sortings | Statement | A | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1300 | |
| 9096 | Our Tanya is Crying Out Loud | dp greedy | Statement | B | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1400 | |
| 5959 | Phone Numbers | constructive algorithms implementation strings | Statement | C | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1500 | |
| 3663 | Alena And The Heater | binary search implementation | Statement | D | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1600 | |
| 3886 | Cashback | data structures dp greedy math | Statement | E | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2000 | |
| 2712 | Machine Learning | brute force data structures | Statement | F | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2600 | |
| 10984 | Weird Subtraction Process | math number theory | Statement | B | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1200 | |
| 8959 | String Transformation | greedy strings | Statement | C | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1300 | |
| 4503 | Timetable | dp | Statement | D | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 1800 | ||
| 1121 | Largest Beautiful Number | greedy implementation | Statement | E | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2200 | |
| 581 | Fibonacci String Subsequences | combinatorics dp matrices | Statement | F | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2500 | |
| 706 | Almost Increasing Array | data structures dp | Statement | G | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2600 | |
| 16800 | Partition | greedy | Statement | A | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 800 | |
| 14061 | Protect Sheep | brute force dfs and similar graphs implementation | Statement | A | Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1) {948} | PROGRAMMING | 1000 | ||
| 5435 | Zebras | greedy | Statement | A | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 1600 | |
| 3743 | A Leapfrog in the Array | constructive algorithms math | Statement | B | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 1700 | ||
| 2098 | Data Center Maintenance | dfs and similar graphs | Statement | C | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 2000 | ||
| 835 | Curfew | binary search brute force greedy sortings | Statement | D | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 2400 | ||
| 658 | Binary Cards | brute force | Statement | E | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 2700 | ||
| 60 | Astronomy | geometry probabilities | Statement | F | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 3200 | ||
| 7639 | Intercepted Message | greedy implementation | Statement | B | Codeforces Round 469 (Div. 2) {950} | PROGRAMMING | 1100 | ||
| 15510 | Left-handers, Right-handers and Ambidexters | implementation math | Statement | A | Codeforces Round 469 (Div. 2) {950} | PROGRAMMING | 58291 | 900 | |
| 2929 | Ravioli Sort | implementation | Statement | C | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 1600 | |
| 2070 | A Map of the Cat | brute force | Statement | B | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 1800 | |
| 2466 | I'm Feeling Lucky! | probabilities | Statement | D | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2000 | |
| 647 | Cheese Board | Statement | E | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2200 | ||
| 239 | Puzzling Language | constructive algorithms | Statement | G | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2500 | |
| 400 | 2 + 2 != 4 | Statement | F | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2700 | ||
| 11413 | Quirky Quantifiers | math | Statement | A | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 800 | |
| 7320 | String Typing | implementation strings | Statement | B | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 1400 | |
| 6787 | Fight Against Traffic | dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 1600 | ||
| 3811 | Matrix Walk | implementation | Statement | C | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 1700 | ||
| 1940 | Water Taps | binary search greedy sortings | Statement | E | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2000 | |
| 2197 | Castle Defense | binary search data structures greedy two pointers | Statement | G | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 2100 | ||
| 1239 | Runner's Problem | dp matrices sortings | Statement | F | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2300 | |
| 607 | Path Counting | combinatorics dp | Statement | H | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2500 | |
| 1072 | Yet Another String Matching Problem | fft math | Statement | I | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2600 | |
| 10605 | Diagonal Walking | implementation | Statement | A | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 900 | |
| 6729 | Feed the cat | greedy math | Statement | A | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 1100 | |
| 4862 | Not simply beatiful strings | implementation | Statement | B | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 1400 | |
| 2739 | Sad powers | binary search math number theory | Statement | C | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2100 | |
| 484 | Scissors | brute force strings | Statement | D | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2700 | |
| 384 | Heaps | dp trees | Statement | F | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2800 | |
| 96 | Icicles | Statement | E | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | 2900 | |||
| 5810 | Tritonic Iridescence | implementation | Statement | A | Codeforces Round 472 (rated, Div. 2, based on VK Cup 2018 Round 2) {957} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1300 | |
| 3507 | Maximum Control (easy) | implementation | Statement | B1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1100 | |
| 2939 | Encryption (easy) | brute force | Statement | C1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1400 | |
| 2096 | Hyperspace Jump (easy) | expression parsing math | Statement | D1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1500 | |
| 1700 | Death Stars (easy) | implementation | Statement | A1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1600 | |
| 1703 | Lightsabers (easy) | implementation | Statement | F1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1700 | |
| 1559 | Guard Duty (easy) | brute force geometry greedy math | Statement | E1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1800 | |
| 1268 | Lightsabers (medium) | binary search two pointers | Statement | F2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 1900 | ||
| 1276 | Encryption (medium) | dp | Statement | C2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2100 |