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 ... 56 57 58 59 60 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 10354 | K for the Price of One (Hard Version) | dp greedy sortings | Statement | B2 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1600 | |
| 4368 | Petya and Exam | greedy sortings two pointers | Statement | C | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1800 | |
| 2266 | Enchanted Artifact | constructive algorithms interactive strings | Statement | D | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2300 | |
| 1157 | The Cake Is a Lie | constructive algorithms data structures dfs and similar graphs | Statement | E | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2400 | |
| 14976 | Temporarily unavailable | implementation math | Statement | A | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 900 | |
| 21940 | Candies Division | math | Statement | B | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1000 | |
| 13315 | Friends and Gifts | constructive algorithms data structures math | Statement | C | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1500 | |
| 6668 | New Year Parties | dp greedy | Statement | E | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 7926 | Christmas Trees | graphs greedy shortest paths | Statement | D | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 1896 | DIY Garland | constructive algorithms greedy trees | Statement | F | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 2400 | |
| 52698 | Minutes Before the New Year | math | Statement | A | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 800 | |
| 10943 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 8179 | New Year and Permutation | combinatorics math | Statement | C | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1700 | |
| 3198 | New Year and Conference | binary search data structures hashing sortings | Statement | D | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2100 | |
| 1312 | New Year and Castle Construction | combinatorics geometry math sortings | Statement | E | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2500 | |
| 331 | New Year and Social Network | data structures graph matchings graphs math trees | Statement | F | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3100 | |
| 179 | Seollal | graphs | Statement | G | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3300 | |
| 18083 | New Year and Naming | implementation strings | Statement | A | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 600 | |
| 23700 | Just Eat It! | dp greedy implementation | Statement | B | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1300 | |
| 24289 | Fadi and LCM | brute force math number theory | Statement | C | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1400 | |
| 7907 | Dr. Evil Underscores | bitmasks brute force dfs and similar divide and conquer dp greedy strings trees | Statement | D | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1800 | |
| 1864 | Delete a Segment | brute force constructive algorithms data structures dp graphs sortings trees two pointers | Statement | E | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2300 | |
| 1171 | Classical? | binary search combinatorics number theory | Statement | F | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2800 | |
| 28584 | Mezo Playing Zoma | math | Statement | A | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 700 | |
| 8951 | Garland | dp greedy sortings | Statement | A | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 1700 | |
| 4801 | Numbers on Tree | constructive algorithms data structures dfs and similar graphs greedy trees | Statement | B | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2000 | |
| 1466 | Madhouse (Easy version) | brute force constructive algorithms interactive math | Statement | C1 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2400 | |
| 683 | Madhouse (Hard version) | brute force constructive algorithms hashing interactive math | Statement | C2 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 633 | LCC | data structures math matrices probabilities | Statement | D | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 250 | Harry The Potter | brute force constructive algorithms dp fft implementation math | Statement | F | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 3200 | |
| 545 | Fedya the Potter Strikes Back | data structures strings | Statement | E | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 3200 | |
| 9513 | Hyperset | brute force data structures implementation | Statement | B | Codeforces Round 612 (Div. 2) {1287} | PROGRAMMING | Codeforces Round #612 - Editorial | 1500 | |
| 20771 | Angry Students | greedy implementation | Statement | A | Codeforces Round 612 (Div. 2) {1287} | PROGRAMMING | Codeforces Round #612 - Editorial | 800 | |
| 17185 | Yet Another Meme Problem | math | Statement | B | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1100 | |
| 18558 | Deadline | binary search brute force math ternary search | Statement | A | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1100 | |
| 13272 | Two Arrays | combinatorics dp | Statement | C | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1600 | |
| 7406 | Minimax Problem | binary search bitmasks | Statement | D | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2000 | |
| 3642 | Messenger Simulator | data structures two pointers | Statement | E | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2100 | |
| 536 | Red-Blue Graph | constructive algorithms flows | Statement | F | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2900 | |
| 8652 | Mind Control | brute force data structures implementation | Statement | A | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1700 |
| 5641 | Irreducible Anagrams | binary search constructive algorithms data structures strings two pointers | Statement | B | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1900 |
| 1845 | Prefix Enlightenment | dfs and similar ds graphs | Statement | C | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 1750.0 | Codeforces Round #616 Editorial | 2400 |
| 855 | Coffee Varieties (hard version) | constructive algorithms graphs interactive | Statement | D | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 2500.0 | Codeforces Round #616 Editorial | 2900 |
| 593 | Cartesian Tree | data structures | Statement | E | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 3000.0 | Codeforces Round #616 Editorial | 3200 |
| 416 | Making Shapes | dp | Statement | F | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 3250.0 | Codeforces Round #616 Editorial | 3500 |
| 19758 | Even But Not Even | greedy math strings | Statement | A | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1000 |
| 14363 | Array Sharpening | greedy implementation | Statement | B | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1300 |
| 673 | Coffee Varieties (easy version) | graphs interactive | Statement | F | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 3000.0 | Codeforces Round #616 Editorial | 2700 |
| 13453 | NEKO's Maze Game | data structures ds implementation | Statement | A | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 500.0 | Codeforces Round #614 Editorial | 1400 |
| 6442 | Aroma's Search | brute force constructive algorithms geometry greedy implementation | Statement | B | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 750.0 | Codeforces Round #614 Editorial | 1800 |
| 2112 | Xenon's Attack on the Gangs | combinatorics dfs and similar dp greedy trees | Statement | C | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1250.0 | Codeforces Round #614 Editorial | 2300 |
| 879 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 321 | Nora's Toy Boxes | bitmasks combinatorics dp | Statement | F | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2750.0 | Codeforces Round #614 Editorial | 3400 |
| 374 | Rin and The Unknown Flower | constructive algorithms greedy interactive math | Statement | E | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2250.0 | Codeforces Round #614 Editorial | 3500 |
| 21406 | JOE is on TV! | combinatorics greedy math | Statement | B | Codeforces Round 614 (Div. 2) {1293} | PROGRAMMING | 750.0 | Codeforces Round #614 Editorial | 1000 |
| 15598 | ConneR and the A.R.C. Markland-N | binary search brute force implementation | Statement | A | Codeforces Round 614 (Div. 2) {1293} | PROGRAMMING | 500.0 | Codeforces Round #614 Editorial | 1100 |
| 22036 | Collecting Packages | implementation sortings | Statement | B | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1200 | |
| 36293 | Product of Three Numbers | greedy math number theory | Statement | C | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1300 | |
| 11908 | MEX maximizing | data structures greedy implementation math | Statement | D | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1600 | |
| 4981 | Obtain a Permutation | greedy implementation math | Statement | E | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 2000 | |
| 5966 | Three Paths on a Tree | dfs and similar dp greedy trees | Statement | F | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 2100 | |
| 48137 | Collecting Coins | math | Statement | A | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 900 | |
| 13119 | Obtain The String | dp greedy strings | Statement | C | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1600 | |
| 9385 | Infinite Prefixes | math strings | Statement | B | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1700 | |
| 9137 | Same GCDs | math number theory | Statement | D | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1800 | |
| 2583 | Permutation Separation | data structures divide and conquer | Statement | E | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 2200 | |
| 1302 | Good Contest | combinatorics dp probabilities | Statement | F | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 2600 | |
| 23055 | Display The Number | greedy | Statement | A | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 900 | |
| 30714 | Food Buying | math | Statement | B | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1000 | |
| 14998 | Yet Another Walking Robot | data structures implementation | Statement | C | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1500 | |
| 14480 | Fight with Monsters | greedy sortings | Statement | D | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1500 | |
| 7613 | String Coloring (easy version) | constructive algorithms dp graphs greedy sortings | Statement | E1 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1800 | |
| 5133 | String Coloring (hard version) | data structures dp | Statement | E2 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2100 | |
| 2941 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 43149 | Array with Odd Sum | math | Statement | A | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 800 | |
| 44 | Paint the String | *special dp strings | Statement | H | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 117 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 205 | Modernization of Treeland | *special dfs and similar trees | Statement | E | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 70 | M-numbers | *special dp math | Statement | G | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 943 | Likes Display | *special implementation | Statement | A | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 31 | Falling Blocks | *special data structures | Statement | I | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 400 | Dream Team | *special greedy | Statement | C | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 414 | Cartoons | *special implementation sortings | Statement | B | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 262 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 12108 | Anu Has a Function | brute force greedy math | Statement | A | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 500.0 | Codeforces Round #618 Editorial | 1500 |
| 5285 | Aerodynamic | geometry | Statement | B | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1000.0 | Codeforces Round #618 Editorial | 1800 |
| 3998 | Water Balance | data structures geometry greedy | Statement | C | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1250.0 | Codeforces Round #618 Editorial | 2100 |
| 465 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 169 | So Mean | interactive math | Statement | E | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 2250.0 | Codeforces Round #618 Editorial | 3400 |
| 23982 | Assigning to Classes | greedy implementation sortings | Statement | B | Codeforces Round 618 (Div. 2) {1300} | PROGRAMMING | 750.0 | Codeforces Round #618 Editorial | 1000 |
| 21166 | Non-zero | implementation math | Statement | A | Codeforces Round 618 (Div. 2) {1300} | PROGRAMMING | 500.0 | Codeforces Round #618 Editorial | 700 |
| 14431 | Motarack's Birthday | binary search greedy ternary search | Statement | B | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1000.0 | Codeforces Round #619 (Div. 2) Editorial | 1500 |
| 9432 | Ayoub's function | binary search combinatorics greedy math strings | Statement | C | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1250.0 | Codeforces Round #619 (Div. 2) Editorial | 1700 |
| 4041 | Time to Run | constructive algorithms graphs implementation | Statement | D | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1750.0 | Codeforces Round #619 (Div. 2) Editorial | 1900 |
| 1542 | Nanosoft | binary search data structures dp implementation | Statement | E | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2500 |
| 1297 | Super Jaber | dfs and similar graphs implementation shortest paths | Statement | F | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2700 |
| 19550 | Three Strings | implementation strings | Statement | A | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 500.0 | Codeforces Round #619 (Div. 2) Editorial | 800 |
| 8 | Who needs suffix structures? | Statement | H | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 382 | Segment tree or Fenwick? | data structures | Statement | C | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 297 | Nash equilibrium | Statement | A | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 |