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 ... 43 44 45 46 47 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 897 | Mobile Phone Network | dfs and similar ds graphs trees | Statement | F | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 2600 | |
| 129 | Pisces | data structures flows trees | Statement | G | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 3300 | |
| 8027 | Weakened Common Divisor | brute force greedy number theory | Statement | B | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 1600 | |
| 6191 | Plasticine zebra | constructive algorithms implementation | Statement | C | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 1600 | |
| 3762 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 576 | Colored Cubes | constructive algorithms implementation matrices | Statement | E | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2600 | |
| 699 | Disjoint Triangles | geometry | Statement | F | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2700 | |
| 740 | Company Acquisitions | constructive algorithms math | Statement | G | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 3100 | |
| 15333 | Doggo Recoloring | implementation sortings | Statement | A | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 900 | |
| 16728 | Palindromic Twist | implementation strings | Statement | A | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1000 | |
| 8438 | Numbers on the Chessboard | implementation math | Statement | B | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1300 | |
| 6932 | Minimum Value Rectangle | greedy | Statement | C | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1600 | |
| 7625 | Mouse Hunt | dfs and similar graphs | Statement | D | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1700 | |
| 2154 | Inverse Coloring | combinatorics dp math | Statement | E | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2100 | |
| 1577 | Session in BSU | binary search dfs and similar ds graph matchings graphs | Statement | F | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2400 | |
| 317 | X-mouse in the Campus | bitmasks math number theory | Statement | G | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2800 | |
| 9275 | Unnatural Conditions | constructive algorithms math | Statement | B | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1300 | |
| 4643 | Rectangles | geometry implementation sortings | Statement | C | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1600 | |
| 1753 | Order book | combinatorics data structures greedy | Statement | D | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2100 | |
| 1153 | Restore Array | constructive algorithms | Statement | E | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2400 | |
| 526 | Make Symmetrical | brute force | Statement | F | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2800 | |
| 501 | Make Square | math | Statement | H | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2900 | |
| 581 | Guess the number | dp interactive | Statement | G | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2900 | |
| 10981 | Find Square | implementation | Statement | A | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 800 | |
| 17194 | Creating the Contest | dp greedy math | Statement | B | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1200 | |
| 12478 | Many Equal Substrings | implementation strings | Statement | A | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1300 | |
| 7666 | Maximal Intersection | greedy math sortings | Statement | C | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1600 | |
| 2626 | Multicolored Markers | binary search brute force math number theory | Statement | F | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 3915 | Concatenated Multiples | implementation math | Statement | D | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 3000 | Tree with Small Distances | dp graphs greedy | Statement | E | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2200 | |
| 12473 | Vasya and Cornfield | geometry | Statement | B | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1100 | |
| 9502 | Vasya and Golden Ticket | implementation | Statement | C | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1300 | |
| 6026 | Vasya and Triangle | geometry number theory | Statement | D | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1700 | |
| 3140 | Vasya and Good Sequences | bitmasks dp | Statement | E | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 2100 | |
| 828 | Putting Boxes Together | data structures | Statement | F | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 2600 | |
| 373 | Linear Congruential Generator | number theory | Statement | G | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 3000 | |
| 139384 | In Search of an Easy Problem | implementation | Statement | A | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 500 | |
| 3947 | Curiosity Has No Limits | Statement | B | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 1500 | ||
| 5372 | Cram Time | greedy | Statement | C | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 1700 | |
| 2835 | Minimum path | greedy | Statement | D | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2000 | |
| 285 | Familiar Operations | brute force graphs math | Statement | F | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2700 | |
| 537 | Triple Flips | constructive algorithms | Statement | E | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2900 | |
| 13011 | Golden Plate | implementation math | Statement | A | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 700 | |
| 6900 | Kitchen Utensils | Statement | A | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1100 | ||
| 5026 | Personalized Cup | Statement | B | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1300 | ||
| 4037 | Playing Piano | constructive algorithms dp | Statement | C | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1800 | |
| 2848 | Barcelonian Distance | geometry implementation | Statement | D | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1900 | |
| 1705 | The Unbearable Lightness of Weights | dp math | Statement | E | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2300 | |
| 978 | Vasya and Maximum Matching | dp trees | Statement | F | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2600 | |
| 472 | Chattering | Statement | G | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2700 | ||
| 14010 | King Escape | dfs and similar graphs implementation | Statement | A | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1000 | |
| 10097 | Square Difference | math number theory | Statement | B | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1100 | |
| 5664 | Permutation Game | brute force dp games | Statement | C | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1600 | |
| 2433 | Divisors | interactive math number theory | Statement | D | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2000 | |
| 666 | Hidden Bipartite Graph | binary search constructive algorithms dfs and similar graphs interactive | Statement | E | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2700 | |
| 394 | Boolean Computer | bitmasks brute force fft math | Statement | F | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2800 | |
| 390 | Chip Game | games | Statement | G | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 3200 | |
| 8946 | Enlarge GCD | number theory | Statement | A | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 1700 | |
| 2168 | Little C Loves 3 II | brute force constructive algorithms flows graph matchings | Statement | B | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2100 | |
| 899 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 655 | Little C Loves 3 III | bitmasks dp math | Statement | E | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3200 | |
| 466 | Intervals of Intervals | binary search data structures two pointers | Statement | D | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3500 | |
| 10241 | Function Height | math | Statement | A | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1000 | |
| 9457 | Vasya and Arrays | greedy two pointers | Statement | D | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1600 | |
| 5737 | Diagonal Walking v.2 | math | Statement | B | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1600 | |
| 10079 | Classy Numbers | combinatorics dp | Statement | C | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1800 | |
| 1663 | Covered Points | fft geometry number theory | Statement | E | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2300 | |
| 1634 | Relatively Prime Powers | combinatorics math number theory | Statement | F | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2400 | |
| 384 | Sources and Sinks | bitmasks brute force dfs and similar | Statement | G | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2800 | |
| 10451 | Reach Median | greedy | Statement | B | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 11278 | Packets | constructive algorithms greedy math | Statement | A | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 19072 | Equalize | dp greedy strings | Statement | C | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 15292 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 2933 | Trips | graphs | Statement | E | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2100 | |
| 1156 | Maximum Reduction | combinatorics data structures math | Statement | F | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2400 | |
| 1053 | Security | data structures string suffix structures | Statement | H | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 314 | A Game on Strings | games | Statement | G | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 13770 | Non-Coprime Partition | constructive algorithms math | Statement | B | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1100 | |
| 9479 | Gambling | greedy sortings | Statement | C | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1300 | |
| 8482 | Slime | dp greedy implementation | Statement | D | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1700 | |
| 999 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 352 | Wrap Around | dp strings | Statement | F | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2900 | |
| 15052 | Equality | implementation strings | Statement | A | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 800 | |
| 2414 | Subway Pursuit | binary search interactive probabilities | Statement | B | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2100 | |
| 1383 | Network Safety | dfs and similar ds graphs math sortings | Statement | C | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2300 | |
| 799 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 1899 | You Are Given a Tree | data structures dp trees | Statement | D | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2700 | |
| 285 | Summer Oenothera Exhibition | data structures | Statement | E | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 3400 | |
| 9667 | Palindrome Dance | greedy | Statement | A | Codeforces Round 507 (Div. 2, based on Olympiad of Metropolises) {1040} | PROGRAMMING | Codeforces Round #507 (based on Olympiad of Metropolises) — Editorial | 1000 | |
| 7155 | Shashlik Cooking | dp greedy math | Statement | B | Codeforces Round 507 (Div. 2, based on Olympiad of Metropolises) {1040} | PROGRAMMING | Codeforces Round #507 (based on Olympiad of Metropolises) — Editorial | 1300 | |
| 14151 | Buying a TV Set | math | Statement | B | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1100 | |
| 9598 | Coffee Break | binary search data structures greedy two pointers | Statement | C | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1500 | |
| 6046 | Glider | binary search data structures two pointers | Statement | D | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1700 | |
| 3638 | Tree Reconstruction | constructive algorithms data structures graphs greedy | Statement | E | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1900 | |
| 1509 | Ray in the tube | data structures divide and conquer dp math | Statement | F | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 2400 | |
| 25388 | Heist | greedy implementation sortings | Statement | A | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 800 | |
| 16684 | Vitamins | bitmasks brute force dp implementation | Statement | B | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 13120 | Benches | binary search implementation | Statement | A | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 4767 | Array Product | constructive algorithms greedy math | Statement | C | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1700 | |
| 6357 | Petya and Array | data structures divide and conquer two pointers | Statement | D | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1800 |