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 ... 53 54 55 56 57 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 627 | Forced Online Queries Problem | data structures divide and conquer ds graphs trees | Statement | F | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 2991 | Workout plan | data structures greedy | Statement | F | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 1500 | |
| 617 | The Light Square | 2-sat dfs and similar greedy | Statement | I | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2200 | |
| 387 | Product Tuples | divide and conquer fft | Statement | E | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2500 | |
| 524 | Xor Spanning Tree | divide and conquer fft graphs | Statement | D | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2600 | |
| 73 | Guarding warehouses | data structures geometry | Statement | B | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2700 | |
| 135 | Function Composition | dfs and similar | Statement | H | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2700 | |
| 187 | Jumping Transformers | dp | Statement | C | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2800 | |
| 160 | BubbleReactor | dp graphs | Statement | A | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2800 | |
| 114 | Alpha planetary system | constructive algorithms graphs shortest paths | Statement | G | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 3300 | |
| 1892 | Periodic integer number | implementation strings | Statement | C | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 2] {1219} | PROGRAMMING | E | 1700 | |
| 684 | Harvester | implementation | Statement | G | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 2] {1219} | PROGRAMMING | E | 2000 | |
| 10341 | Substring Game in the Lesson | games greedy strings | Statement | C | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1300 | |
| 11727 | Multiplication Table | math number theory | Statement | B | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1300 | |
| 3960 | Alex and Julian | bitmasks math number theory | Statement | D | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1900 | |
| 2831 | Tourism | dfs and similar dp ds graphs greedy trees | Statement | E | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2200 | |
| 767 | Gardener Alex | binary search data structures | Statement | F | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2600 | |
| 54 | Geolocation | geometry | Statement | G | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 3200 | |
| 30242 | Cards | implementation sortings strings | Statement | A | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 600 | |
| 17129 | 2048 Game | brute force greedy math | Statement | A | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1000 | |
| 12137 | Knights | constructive algorithms greedy | Statement | B | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1100 | |
| 21885 | Perfect Team | binary search math | Statement | C | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1200 | |
| 9343 | Make The Fence Great Again | dp | Statement | D | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1700 | |
| 1103 | Game With String | games | Statement | E | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2400 | |
| 1077 | Choose a Square | binary search data structures sortings | Statement | F | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2500 | |
| 771 | Graph And Numbers | bitmasks brute force combinatorics dp meet-in-the-middle | Statement | G | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2900 | |
| 15078 | Strings Equalization | strings | Statement | B | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 1000 | |
| 8738 | Save the Nature | binary search greedy | Statement | C | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 1600 | |
| 4104 | Sequence Sorting | dp greedy two pointers | Statement | D | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2000 | |
| 2650 | Paint the Tree | dp sortings trees | Statement | E | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2200 | |
| 2098 | Stack Exterminable Arrays | data structures divide and conquer dp hashing | Statement | F | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2600 | |
| 250 | Wooden Raft | binary search math number theory | Statement | G | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 3100 | |
| 21741 | CME | math | Statement | A | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 600 | |
| 12046 | TV Subscriptions (Easy Version) | implementation | Statement | B1 | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1000 | |
| 10974 | TV Subscriptions (Hard Version) | implementation two pointers | Statement | B2 | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1300 | |
| 9121 | p-binary | bitmasks brute force math | Statement | C | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1600 | |
| 8320 | Power Products | hashing math number theory | Statement | D | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1900 | |
| 1911 | Rock Is Push | binary search dp | Statement | E | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2200 | |
| 895 | Tree Factory | constructive algorithms greedy trees | Statement | F | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2500 | |
| 579 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 15950 | Forgetting Things | math | Statement | A | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 900 | |
| 9865 | Math Problem | math | Statement | A | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1100 | |
| 9763 | Box | constructive algorithms | Statement | B | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1200 | |
| 6508 | Optimal Subsequences (Easy Version) | data structures greedy | Statement | D1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1600 | |
| 5554 | Messy | constructive algorithms | Statement | C | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1700 | |
| 4428 | Optimal Subsequences (Hard Version) | data structures greedy | Statement | D2 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1800 | |
| 1851 | Wrong Answer on test 233 (Easy Version) | dp | Statement | F1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2100 | |
| 1507 | Arson In Berland Forest | binary search graphs graphs shortest paths | Statement | E | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2200 | |
| 1547 | Wrong Answer on test 233 (Hard Version) | combinatorics math | Statement | F2 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2400 | |
| 1088 | Not Same | constructive algorithms | Statement | G | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2500 | |
| 11612 | Filling the Grid | implementation math | Statement | B | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1300 | |
| 9145 | Primes and Multiplication | math number theory | Statement | C | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1600 | |
| 5256 | Complete Tripartite | brute force constructive algorithms graphs hashing implementation | Statement | D | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1800 | |
| 2843 | Another Filling the Grid | combinatorics dp math | Statement | E | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 2300 | |
| 443 | One Node is Gone | constructive algorithms implementation trees | Statement | F | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 2700 | |
| 22046 | Distinct Digits | brute force implementation | Statement | A | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 800 | |
| 18861 | Ania and Minimizing | greedy implementation | Statement | B | Codeforces Round 588 (Div. 2) {1230} | PROGRAMMING | 70008 | 1000 | |
| 21832 | Dawid and Bags of Candies | brute force implementation | Statement | A | Codeforces Round 588 (Div. 2) {1230} | PROGRAMMING | 70008 | 800 | |
| 3920 | Increasing Matrix | greedy | Statement | C | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1100 | |
| 850 | Middle-Out | constructive algorithms greedy strings | Statement | E | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2000 | |
| 18938 | Social Network (easy version) | implementation | Statement | B1 | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1000 | |
| 17103 | Social Network (hard version) | data structures implementation | Statement | B2 | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1200 | |
| 12777 | Pipes | dp implementation | Statement | C | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1400 | |
| 15643 | Distinct Characters Queries | data structures | Statement | D | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1600 | |
| 2826 | Special Permutations | math | Statement | E | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 2000 | |
| 2716 | Yet Another Substring Reverse | bitmasks dp | Statement | F | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 2400 | |
| 28149 | Equalize Prices Again | math | Statement | A | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 900 | |
| 10214 | Labs | constructive algorithms greedy implementation | Statement | C | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 1300 | |
| 11231 | Alice and the List of Presents | combinatorics math | Statement | B | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 1400 | |
| 1683 | Alice and the Doll | brute force data structures greedy implementation | Statement | D | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2100 | |
| 678 | Alice and the Unfair Game | binary search data structures dp ds | Statement | E | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2600 | |
| 178 | Alice and the Cactus | dfs and similar graphs math probabilities | Statement | F | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2900 | |
| 16584 | Stones | brute force greedy math | Statement | A | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 800 | |
| 20344 | Balanced Rating Changes | implementation math | Statement | A | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1100 | |
| 16780 | Balanced Tunnel | data structures sortings two pointers | Statement | B | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1300 | |
| 6149 | Balanced Removals (Easier) | constructive algorithms geometry greedy | Statement | C1 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1600 | |
| 4389 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 4290 | Balanced Playlist | binary search data structures implementation | Statement | D | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 1365 | Balanced Binary Search Trees | dp math | Statement | E | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2400 | |
| 911 | Balanced Domino Placements | combinatorics dp | Statement | F | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 2600 | |
| 386 | Balanced Reversals | constructive algorithms | Statement | H | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3200 | |
| 128 | Balanced Distribution | data structures dp greedy | Statement | G | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3600 | |
| 13784 | Kill `Em All | greedy sortings | Statement | B | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1300 | |
| 7525 | Standard Free2play | dp greedy math | Statement | C | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1600 | |
| 6103 | AB-string | binary search combinatorics dp strings | Statement | D | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1800 | |
| 3132 | Keyboard Purchase | bitmasks dp | Statement | E | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2200 | |
| 1916 | The Maximum Subtree | dfs and similar dp graphs trees | Statement | F | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2300 | |
| 413 | Adilbek and the Watering System | data structures greedy sortings | Statement | G | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2700 | |
| 24876 | Prime Subtraction | math number theory | Statement | A | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 900 | |
| 7395 | Ivan the Fool and the Probability Theory | combinatorics dp math | Statement | A | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1700 | |
| 1583 | Queue in the Train | data structures greedy implementation | Statement | C | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2300 | |
| 2122 | Catowice City | 2-sat dfs and similar graph matchings graphs | Statement | D | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2400 | |
| 1066 | The World Is Just a Programming Task (Hard Version) | implementation | Statement | B | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2500 | |
| 1046 | Turtle | dp implementation | Statement | E | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 3100 | |
| 289 | Swiper, no swiping! | graphs implementation | Statement | F | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 3400 | |
| 269 | Football | graphs | Statement | F | Codeforces Round 591 (Div. 1, based on Technocup 2020 Elimination Round 1) {1240} | PROGRAMMING | Сodeforces Round 591 (Технокубок 2020 — Отборочный раунд 1) Разбор | 3100 | |
| 12751 | Tile Painting | constructive algorithms math number theory | Statement | A | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1500 | |
| 7851 | 0-1 MST | dfs and similar ds graphs sortings | Statement | B | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1900 | |
| 1712 | Sum Balance | bitmasks dfs and similar dp graphs | Statement | C | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 2400 | |
| 131 | Planar Perimeter | constructive algorithms graphs | Statement | E | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 3200 |