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 ... 62 63 64 65 66 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 24840 | Substring Removal Game | games greedy sortings strings | Statement | B | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1133 | Running Competition | bitmasks fft math number theory | Statement | G | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 27900 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1298 | Controversial Rounds | binary search data structures dp ds two pointers | Statement | F | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 11677 | Colored Rectangles | dp graph matchings greedy sortings | Statement | D | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 27816 | Bad Triangle | geometry math | Statement | A | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1666 | Yet Another Segments Subset | dp sortings | Statement | F | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 2307 | Weights Division (hard version) | binary search data structures dfs and similar greedy trees two pointers | Statement | E2 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 5932 | Weights Division (easy version) | data structures dfs and similar greedy trees | Statement | E1 | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 68894 | Remove Smallest | greedy sortings | Statement | A | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 44151 | Gifts Fixing | greedy | Statement | B | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 29681 | Boats Competition | brute force | Statement | C | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 18539 | Binary String To Subsequences | constructive algorithms data structures greedy | Statement | D | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 10513 | Zigzags | brute force data structures dp math two pointers | Statement | D | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 924 | x-prime Substrings | bitmasks dp greedy number theory string suffix structures strings | Statement | F | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 27220 | String Similarity | brute force constructive algorithms strings | Statement | A | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11290 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 1010 | Mercenaries | bitmasks combinatorics data structures math two pointers | Statement | G | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 5626 | Clear the Multiset | divide and conquer dp greedy sortings | Statement | E | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 17555 | Binary String Reconstruction | 2-sat constructive algorithms greedy strings | Statement | C | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 21231 | Ternary Sequence | constructive algorithms greedy math | Statement | B | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1000.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 1787 | Reverse and Swap | binary search bitmasks data structures divide and conquer | Statement | F | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 24672 | Mere Array | constructive algorithms math number theory number theory sortings sortings | Statement | C | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 9439 | Maximum Distributed Tree | constructive algorithms dfs and similar greedy math number theory sortings trees | Statement | D | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 1750.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 2472 | Divide Square | data structures divide and conquer geometry implementation sortings | Statement | E | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 27708 | Distance and Axis | math number theory | Statement | A | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 500.0 | Codeforces Round #665 (Div. 2) Editorial | |
| 207 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 116 | Roads | *special geometry sortings | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 1216 | Fancy Fence | *special data structures dp ds math sortings | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 294 | The Potion of Great Power | *special binary search data structures graphs interactive sortings two pointers | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 372 | Spring cleaning | *special data structures dfs and similar graphs trees | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 54 | Chess Rush | *special combinatorics dp implementation math | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 7551 | Tree Tag | dfs and similar dp games trees | Statement | B | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 1133 | Game of Pairs | constructive algorithms dfs and similar interactive math number theory | Statement | D | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 2250.0 | Codeforces Round #668 Editorial | |
| 2726 | Fixed Point Removal | binary search data structures greedy | Statement | C | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1500.0 | Codeforces Round #668 Editorial | |
| 1301 | Bricks | flows graph matchings graphs | Statement | E | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 3000.0 | Codeforces Round #668 Editorial | |
| 15906 | Balanced Bitstring | implementation strings | Statement | A | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 500.0 | Codeforces Round #668 Editorial | |
| 21539 | Permutation Forgery | constructive algorithms | Statement | A | Codeforces Round 668 (Div. 2) {1405} | PROGRAMMING | 500.0 | Codeforces Round #668 Editorial | |
| 21854 | Array Cancellation | constructive algorithms | Statement | B | Codeforces Round 668 (Div. 2) {1405} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 3558 | Three Sequences | binary search data structures greedy math | Statement | D | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 21737 | Subset Mex | greedy implementation math | Statement | A | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 22959 | Maximum Product | brute force dp greedy implementation sortings | Statement | B | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 10472 | Link Cut Centroids | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1500.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 1739 | Deleting Numbers | binary search brute force interactive number theory | Statement | E | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 2750.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 1743 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 5066 | Discrete Centrifugal Jumps | binary search data structures dp greedy | Statement | D | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2000.0 | Codeforces Round #669 Editorial | |
| 12391 | Chocolate Bunny | constructive algorithms interactive math two pointers | Statement | C | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1500.0 | Codeforces Round #669 Editorial | |
| 17199 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
| 20600 | Ahahahahahahahaha | constructive algorithms math | Statement | A | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 500.0 | Codeforces Round #669 Editorial | |
| 2431 | Two Different | bitmasks constructive algorithms divide and conquer greedy | Statement | F | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 4393 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 415 | Rainbow Triples | greedy | Statement | H | Grakn Forces 2020 {1408} | PROGRAMMING | 3750.0 | Grakn Forces -- Editorial | |
| 8934 | Discrete Acceleration | binary search implementation math two pointers | Statement | C | Grakn Forces 2020 {1408} | PROGRAMMING | 1250.0 | Grakn Forces -- Editorial | |
| 1080 | Clusterization Counting | combinatorics dp ds fft graphs | Statement | G | Grakn Forces 2020 {1408} | PROGRAMMING | 3000.0 | Grakn Forces -- Editorial | |
| 12537 | Circle Coloring | constructive algorithms | Statement | A | Grakn Forces 2020 {1408} | PROGRAMMING | 500.0 | Grakn Forces -- Editorial | |
| 179 | Bitwise Magic | dp math | Statement | I | Grakn Forces 2020 {1408} | PROGRAMMING | 3750.0 | Grakn Forces -- Editorial | |
| 2019 | Avoid Rainbow Cycles | ds graphs greedy sortings | Statement | E | Grakn Forces 2020 {1408} | PROGRAMMING | 2500.0 | Grakn Forces -- Editorial | |
| 10061 | Arrays Sum | constructive algorithms greedy math | Statement | B | Grakn Forces 2020 {1408} | PROGRAMMING | 1000.0 | Grakn Forces -- Editorial | |
| 68790 | Yet Another Two Integers Problem | math | Statement | A | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 23573 | Yet Another Array Restoration | brute force math | Statement | C | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 7936 | Two Platforms | binary search dp sortings two pointers | Statement | E | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 4543 | Subsequences of Length Two | dp greedy | Statement | F | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 29349 | Minimum Product | brute force greedy math | Statement | B | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 19773 | Decrease the Sum of Digits | greedy math | Statement | D | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 382 | The Thorny Path | greedy math matrices | Statement | F | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2750.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 1676 | Poman Numbers | greedy implementation math | Statement | E | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2250.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 8086 | Peaceful Rooks | dfs and similar ds graphs | Statement | C | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 1750.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 682 | No Game No Life | games math matrices | Statement | G | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 3250.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 20780 | In-game Chat | implementation | Statement | A | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 500.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 2549 | Grime Zoo | constructive algorithms greedy implementation | Statement | D | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 2000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 20453 | Fair Numbers | brute force number theory | Statement | B | Technocup 2021 - Elimination Round 3 {1411} | PROGRAMMING | 1000.0 | Technocup 2021 Elimination Round 3 and Round #692 (Div. 1 + Div. 2) Editorial | |
| 2049 | Solo mid Oracle | binary search math ternary search | Statement | E | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2250.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 6560 | Shurikens | data structures greedy implementation | Statement | D | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 2000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 801 | Roads and Ramen | data structures | Statement | F | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 3000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 5793 | Perform Easily | data structures dp implementation sortings two pointers | Statement | C | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 1500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 14880 | Finding Sasuke | constructive algorithms math | Statement | A | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 11750 | A New Technique | implementation | Statement | B | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 1000.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 5562 | XOR-gun | bitmasks brute force constructive algorithms | Statement | D | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 12259 | Repainting Street | brute force brute force greedy | Statement | B | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 15308 | Prison Break | brute force brute force math | Statement | A | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 2777 | New Game Plus! | constructive algorithms greedy math | Statement | E | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 493 | Cakes for Clones | dp | Statement | F | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 11067 | Bouncing Ball | brute force dp implementation | Statement | C | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 13069 | k-Amazing Numbers | binary search data structures implementation two pointers | Statement | A | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 1500 |
| 4543 | XOR Inverse | bitmasks data structures divide and conquer greedy strings trees | Statement | C | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1250.0 | Codeforces Round #673 Editorial | 2000 |
| 6228 | Make Them Equal | constructive algorithms greedy math | Statement | B | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 2000 |
| 2158 | Graph and Queries | data structures dfs and similar ds graphs trees | Statement | D | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2000.0 | Codeforces Round #673 Editorial | 2600 |
| 353 | Split | data structures dp greedy | Statement | E | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2250.0 | Codeforces Round #673 Editorial | 3200 |
| 488 | Showing Off | flows graph matchings greedy | Statement | F | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2750.0 | Codeforces Round #673 Editorial | 3300 |
| 14525 | Two Arrays | greedy math sortings | Statement | B | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 1000.0 | Codeforces Round #673 Editorial | 1100 |
| 18346 | Copy-paste | greedy math | Statement | A | Codeforces Round 673 (Div. 2) {1417} | PROGRAMMING | 500.0 | Codeforces Round #673 Editorial | 800 |
| 4429 | Trash Problem | data structures hashing implementation two pointers | Statement | D | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 2085 | Three Occurrences | data structures hashing two pointers | Statement | G | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 16817 | Negative Prefixes | greedy sortings | Statement | B | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 21060 | Mortal Kombat Tower | dp greedy | Statement | C | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 1905 | Expected Damage | binary search combinatorics math probabilities | Statement | E | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 378 | Equal Product | data structures math number theory two pointers | Statement | F | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 24182 | Buying Torches | math | Statement | A | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 16391 | Stairs | brute force constructive algorithms greedy implementation math two pointers | Statement | B | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 750.0 | Codeforces Round #671 Editorial | |
| 16083 | Sage's Birthday (hard version) | binary search constructive algorithms greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 671 (Div. 2) {1419} | PROGRAMMING | 1000.0 | Codeforces Round #671 Editorial |