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 ... 54 55 56 57 58 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 201 | Number Discovery | math | Statement | D | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 3400 | |
| 14988 | Character Swap (Easy Version) | strings | Statement | B1 | Codeforces Round 599 (Div. 2) {1243} | PROGRAMMING | Codeforces Round #599 Editorial | 1100 | |
| 7153 | Character Swap (Hard Version) | strings | Statement | B2 | Codeforces Round 599 (Div. 2) {1243} | PROGRAMMING | Codeforces Round #599 Editorial | 1600 | |
| 15784 | Maximum Square | implementation | Statement | A | Codeforces Round 599 (Div. 2) {1243} | PROGRAMMING | Codeforces Round #599 Editorial | 800 | |
| 16131 | Rooms and Staircases | brute force implementation | Statement | B | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1000 | |
| 7672 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 7731 | The Football Season | brute force math number theory | Statement | C | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1900 | |
| 5365 | Minimizing Difference | binary search constructive algorithms greedy sortings ternary search two pointers | Statement | E | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2000 | |
| 1556 | Chips | constructive algorithms implementation | Statement | F | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2300 | |
| 1374 | Running in Pairs | constructive algorithms greedy math | Statement | G | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2500 | |
| 19381 | Pens and Pencils | math | Statement | A | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 700 | |
| 14327 | Good ol' Numbers Coloring | math number theory | Statement | A | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1000 | |
| 13956 | Restricted RPS | constructive algorithms dp greedy | Statement | B | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1200 | |
| 17960 | Constanze's Machine | dp | Statement | C | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1400 | |
| 7801 | Shichikuji and Power Grid | ds graphs greedy shortest paths trees | Statement | D | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1900 | |
| 1284 | Hyakugoku and Ladders | dp probabilities shortest paths | Statement | E | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 2024 | Daniel and Spring Cleaning | bitmasks brute force combinatorics dp | Statement | F | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 183 | Cursor Distance | Statement | F | Codeforces Round 596 (Div. 1, based on Technocup 2020 Elimination Round 2) {1246} | PROGRAMMING | Tutorial | 3400 | ||
| 2412 | The World Is Just a Programming Task (Easy Version) | brute force dp greedy implementation | Statement | D1 | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1900 | |
| 14264 | Integer Points | geometry math | Statement | A | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 900 | |
| 17049 | Grow The Tree | greedy math sortings | Statement | B | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 900 | |
| 20917 | Books Exchange (easy version) | ds math | Statement | B1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1000 | |
| 15731 | Good Numbers (easy version) | brute force greedy implementation | Statement | C1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1300 | |
| 17059 | Books Exchange (hard version) | dfs and similar ds math | Statement | B2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1300 | |
| 12798 | Good Numbers (hard version) | binary search greedy math meet-in-the-middle | Statement | C2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1500 | |
| 9924 | By Elevator or Stairs? | dp shortest paths | Statement | E | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1700 | |
| 5170 | Too Many Segments (easy version) | greedy | Statement | D1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1900 | |
| 5356 | Too Many Segments (hard version) | data structures greedy sortings | Statement | D2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2000 | |
| 2452 | Maximum Weight Subset | dp trees | Statement | F | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2500 | |
| 22646 | Yet Another Dividing into Teams | math | Statement | A | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 900 | |
| 7535 | Data Center | brute force implementation | Statement | F | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1000 | ||
| 4107 | Berstagram | implementation | Statement | A | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1400 | ||
| 4083 | Happy Birthday | math | Statement | H | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1500 | ||
| 4153 | Divide The Students | binary search greedy math | Statement | L | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1700 | ||
| 2992 | The Parade | binary search greedy | Statement | J | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 2637 | The Feast and the Bus | brute force constructive algorithms greedy math | Statement | B | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 1607 | Wires | dfs and similar graphs greedy | Statement | N | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2200 | ||
| 1344 | Trip to Saint Petersburg | data structures | Statement | C | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2300 | ||
| 729 | Discarding Game | dp greedy two pointers | Statement | G | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2400 | ||
| 828 | The Coronation | graphs implementation | Statement | E | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2500 | ||
| 365 | SmartGarden | constructive algorithms divide and conquer | Statement | M | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2700 | ||
| 136 | Show Must Go On | binary search brute force greedy shortest paths | Statement | I | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 184 | Conference Problem | dp | Statement | D | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 205 | Projectors | flows graphs | Statement | K | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3200 | ||
| 19949 | Broken Keyboard | brute force strings two pointers | Statement | A | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1000 | |
| 11091 | Binary Palindromes | greedy strings | Statement | B | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1400 | |
| 12820 | Minimize The Integer | greedy two pointers | Statement | C | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1500 | |
| 6104 | Salary Changing | binary search greedy sortings | Statement | D | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1800 | |
| 2396 | Voting (Easy Version) | data structures dp greedy | Statement | E1 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2200 | |
| 2722 | Voting (Hard Version) | binary search data structures greedy | Statement | E2 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2300 | |
| 839 | Red-White Fence | combinatorics fft | Statement | F | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2600 | |
| 5694 | Copying Homework | Statement | A | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1000 | ||
| 3789 | Even Path | data structures implementation | Statement | C | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1600 | |
| 2702 | Twin Buildings | greedy implementation | Statement | H | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1900 | |
| 1882 | Addition Robot | data structures math matrices | Statement | K | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2200 | |
| 1264 | Songwriter | greedy two pointers | Statement | E | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2300 | |
| 1454 | Performance Review | data structures | Statement | G | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2300 | |
| 953 | Regular Forestation | hashing trees | Statement | F | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2500 | |
| 734 | Tiling Terrace | brute force dp | Statement | J | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 595 | Road Construction | flows graphs | Statement | L | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 531 | Cleaning Robots | dp trees | Statement | B | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 354 | Find String in a Grid | data structures dp strings trees | Statement | D | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2900 | |
| 31 | Mission Possible | Statement | I | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 3200 | ||
| 18236 | Single Push | implementation | Statement | A | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1000 | |
| 11265 | Silly Mistake | greedy implementation | Statement | B | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1400 | |
| 14513 | Sweets Eating | dp greedy math sortings | Statement | C | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1500 | |
| 9419 | Harmonious Graph | constructive algorithms dfs and similar ds graphs greedy sortings | Statement | D | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1700 | |
| 2887 | Antenna Coverage | data structures dp greedy sortings | Statement | E | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2200 | |
| 1902 | Cheap Robot | binary search ds graphs shortest paths trees | Statement | F | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2600 | |
| 5300 | Feeding Chicken | constructive algorithms greedy implementation | Statement | A | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 1900 | |
| 4726 | Send Boxes to Alice (Easy Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B1 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2000 | |
| 3224 | Send Boxes to Alice (Hard Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B2 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2100 | |
| 1496 | Point Ordering | constructive algorithms geometry interactive math | Statement | C | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2300 | |
| 1286 | Tree Queries | data structures probabilities trees | Statement | D | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2600 | |
| 275 | Send Tree to Charlie | combinatorics dfs and similar ds trees | Statement | E | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 3200 | |
| 12070 | Fridge Lockers | graphs implementation | Statement | B | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 1200 | |
| 6781 | League of Leesins | constructive algorithms implementation | Statement | C | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 1600 | |
| 17431 | Changing Volume | math | Statement | A | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 800 | |
| 30114 | Payment Without Change | math | Statement | A | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1000 | |
| 13199 | Minimize the Permutation | greedy | Statement | B | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1400 | |
| 12215 | Binary String Minimizing | greedy | Statement | D | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1500 | |
| 6973 | Platforms Jumping | greedy | Statement | C | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1700 | |
| 4207 | Yet Another Division Into Teams | dp greedy sortings | Statement | E | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 3375 | Equalizing Two Strings | constructive algorithms sortings strings | Statement | F | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 21268 | Magic Stick | math | Statement | B | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1000 | |
| 16156 | Dominated Subarray | greedy implementation sortings strings two pointers | Statement | C | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1200 | |
| 7668 | Yet Another Monster Killing Problem | binary search data structures dp greedy sortings two pointers | Statement | D | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1700 | |
| 4284 | The Contest | data structures dp greedy | Statement | E | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2000 | |
| 2090 | Make Them Similar | bitmasks brute force hashing meet-in-the-middle | Statement | F | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2400 | |
| 632 | Divisor Set | divide and conquer fft greedy math number theory | Statement | G | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2700 | |
| 20851 | Two Rival Students | greedy math | Statement | A | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 700 | |
| 14979 | Heating | math | Statement | A | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1000 | |
| 16009 | Obtain Two Zeroes | binary search math | Statement | B | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1200 | |
| 8322 | Infinite Fence | greedy math number theory | Statement | C | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1700 | |
| 3940 | A Game with Traps | binary search dp greedy sortings | Statement | D | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1900 | |
| 1758 | Tournament | brute force dp greedy | Statement | E | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2400 | |
| 553 | Colored Tree | data structures trees | Statement | F | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2700 | |
| 401 | Xor-Set | bitmasks divide and conquer math | Statement | F | Codeforces Round 602 (Div. 1, based on Technocup 2020 Elimination Round 3) {1261} | PROGRAMMING | Tutorial | 3100 | |
| 16511 | Sweet Problem | math | Statement | A | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1200 | |
| 11461 | PIN Codes | greedy implementation | Statement | B | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 |