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 ... 67 68 69 70 71 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2732 | Garden of the Sun | constructive algorithms graphs | Statement | C | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 1500.0 | Codeforces Round #706 Editorial | |
| 17234 | Diamond Miner | geometry greedy math sortings | Statement | A | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 1354 | BFS Trees | combinatorics dfs and similar graphs math shortest paths trees | Statement | D | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2000.0 | Codeforces Round #706 Editorial | |
| 21190 | Split it! | brute force constructive algorithms greedy strings | Statement | A | Codeforces Round 706 (Div. 2) {1496} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 17680 | Max and Mex | implementation math | Statement | B | Codeforces Round 706 (Div. 2) {1496} | PROGRAMMING | 1000.0 | Codeforces Round #706 Editorial | |
| 20868 | M-arrays | constructive algorithms greedy math | Statement | B | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 750.0 | Codeforces Round #708 Editorial | 1200 |
| 26417 | k-LCM (easy version) | constructive algorithms math | Statement | C1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 750.0 | Codeforces Round #708 Editorial | 1200 |
| 17718 | k-LCM (hard version) | constructive algorithms math | Statement | C2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 1600 |
| 8483 | Square-free division (easy version) | data structures dp greedy math number theory | Statement | E1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 1700 |
| 1775 | Square-free division (hard version) | data structures dp greedy hashing math number theory | Statement | E2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 2500 |
| 1569 | Genius | bitmasks dp graphs | Statement | D | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1750.0 | Codeforces Round #708 Editorial | 2500 |
| 24669 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 1962 | Two Houses | brute force combinatorics graphs interactive probabilities sortings | Statement | E | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 9986 | Planar Reflections | brute force combinatorics data structures dp | Statement | C | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1750.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 23509 | GCD Sum | brute force math | Statement | A | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 941 | Christmas Game | data structures dfs and similar dp games math trees | Statement | F | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 3000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 17840 | Box Fitting | binary search bitmasks data structures greedy | Statement | B | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 2357 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 6022 | The Number of Pairs | math number theory | Statement | D | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 12813 | Minimum Grid Path | brute force data structures dp greedy | Statement | C | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 198 | Graph Coloring | data structures graphs interactive | Statement | G | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 21367 | Domino on Windowsill | constructive algorithms math | Statement | A | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 1389 | Diameter Cuts | dfs and similar dp trees | Statement | F | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 1541 | Chaotic Merge | combinatorics dp | Statement | E | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 20963 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 8987 | Going Home | brute force implementation math | Statement | A | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 1800 |
| 2114 | Two chandeliers | binary search brute force chinese remainder theorem math number theory | Statement | B | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 2200 |
| 826 | Matrix Sorting | bitmasks constructive algorithms dfs and similar greedy hashing string suffix structures two pointers | Statement | C | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 1500.0 | Codeforces Round #707 Editorial | 2600 |
| 482 | Tiles for Bathroom | two pointers | Statement | D | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 2000.0 | Codeforces Round #707 Editorial | 2900 |
| 284 | Subset Trick | binary search data structures | Statement | E | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 2500.0 | Codeforces Round #707 Editorial | 3300 |
| 355 | Cupboards Jumps | dp | Statement | F | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 3000.0 | Codeforces Round #707 Editorial | 3500 |
| 11679 | Alexey and Train | implementation | Statement | A | Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics) {1501} | PROGRAMMING | 500.0 | Codeforces Round #707 Editorial | 800 |
| 19487 | Napoleon Cake | dp implementation sortings | Statement | B | Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics) {1501} | PROGRAMMING | 1000.0 | Codeforces Round #707 Editorial | 900 |
| 13641 | Balance the Bits | constructive algorithms greedy | Statement | A | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 750.0 | T | 1600 |
| 7118 | 3-Coloring | constructive algorithms games interactive | Statement | B | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1000.0 | T | 1700 |
| 3499 | Travelling Salesman Problem | binary search data structures dp greedy shortest paths sortings | Statement | C | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1250.0 | T | 2200 |
| 1142 | Flip the Cards | 2-sat constructive algorithms data structures ds greedy sortings | Statement | D | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1750.0 | T | 2600 |
| 726 | 2-Coloring | combinatorics dp math | Statement | E | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 2500.0 | T | 3100 |
| 185 | Balance the Cards | constructive algorithms data structures divide and conquer geometry graphs implementation | Statement | F | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 4000.0 | T | 3500 |
| 19262 | Flip the Bits | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 1000.0 | Codeforces Round #712 Editorial | 1200 |
| 21887 | Déjà Vu | constructive algorithms strings | Statement | A | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 500.0 | Codeforces Round #712 Editorial | 800 |
| 811 | Xenolith? Hippodrome? | Statement | D | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 564 | Mysterious language again, seriously? | Statement | I | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 1523 | Math | constructive algorithms | Statement | F | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 517 | L BREAK into program | Statement | H | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 14783 | Is it rated - 2 | implementation interactive | Statement | A | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 6499 | Fibonacci Words | constructive algorithms implementation | Statement | C | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 309 | Encoded message | Statement | G | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 6234 | DMCA | constructive algorithms implementation | Statement | B | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 1817 | Cakewalk | constructive algorithms greedy implementation shortest paths | Statement | E | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 3355 | Triangular Paths | constructive algorithms greedy math shortest paths sortings | Statement | F | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 30915 | Strange Table | math | Statement | A | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 13315 | Restoring the Permutation | constructive algorithms data structures ds greedy | Statement | E | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 20367 | Partial Replacement | greedy implementation | Statement | B | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 4422 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 22481 | Epic Transformation | constructive algorithms greedy | Statement | D | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 26288 | Double-ended Strings | brute force dp hashing strings | Statement | C | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 353 | Tree Calendar | brute force constructive algorithms dfs and similar sortings | Statement | E | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 595 | Swap Pass | constructive algorithms geometry sortings | Statement | D | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 128 | Optimal Encoding | brute force data structures | Statement | F | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 4000.0 | Codeforces Round #715 Editorial | |
| 1539 | Complete the MST | data structures dfs and similar ds graphs greedy math | Statement | C | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 6331 | Binary Literature | constructive algorithms greedy implementation math strings two pointers | Statement | A | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 750.0 | Codeforces Round #715 Editorial | |
| 4076 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 21862 | TMT Document | greedy | Statement | B | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 13014 | The Sports Festival | dp greedy | Statement | C | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 26159 | Average Height | constructive algorithms | Statement | A | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 500.0 | Codeforces Round #715 Editorial | |
| 5572 | King's Task | brute force graphs implementation | Statement | K | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 533 | Japanese Game | constructive algorithms math | Statement | J | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 508 | Is It Rated? | greedy interactive math probabilities | Statement | I | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 101 | Hard Optimization | dp | Statement | H | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 1322 | Guide | Statement | G | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | ||||
| 59 | Fiber Shape | Statement | F | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | |||
| 260 | Equilibrium Point /\textbackslash/\textbackslash | Statement | E | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | ||||
| 1965 | Digits | brute force dp math number theory | Statement | D | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 221 | Cactus Not Enough | dfs and similar graphs | Statement | C | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 872 | Button Lock | flows graph matchings | Statement | B | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 157 | ASCII Automata Art | Statement | A | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | ||||
| 24814 | Yet Another Card Deck | brute force data structures implementation trees | Statement | C | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 27857 | Review Site | greedy | Statement | A | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 11694 | Min Cost String | brute force constructive algorithms dfs and similar graphs greedy | Statement | D | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 23209 | GCD Length | constructive algorithms math number theory | Statement | B | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 2635 | Colorings and Dominoes | combinatorics dp math | Statement | E | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 827 | Chips on a Board | bitmasks brute force data structures games sortings | Statement | G | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 453 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 66789 | Spy Detected! | brute force implementation | Statement | A | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 8407 | Short Task | brute force dp math number theory | Statement | G | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 10661 | Permutation by Sum | greedy math | Statement | E | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 6342 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 22916 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 25654 | Almost Rectangle | implementation | Statement | B | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 20488 | A-B Palindrome | constructive algorithms implementation strings | Statement | C | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 1298 | Swapping Problem | brute force constructive algorithms data structures sortings | Statement | F | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 3500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 5635 | GCD and MST | constructive algorithms data structures ds graphs implementation number theory sortings | Statement | D | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2000.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 1543 | Cost Equilibrium | combinatorics constructive algorithms math sortings | Statement | E | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2750.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 19497 | Array and Peaks | constructive algorithms implementation | Statement | A | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 15335 | AND Sequences | bitmasks combinatorics constructive algorithms | Statement | B | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 1250.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 14566 | Add One | dp matrices | Statement | C | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 1500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 15627 | Product 1 Modulo N | constructive algorithms math number theory | Statement | C | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 1500.0 | Codeforces round #716 editorial | |
| 24413 | Perfectly Imperfect Array | math number theory | Statement | A | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 500.0 | Codeforces round #716 editorial | |
| 4407 | Cut and Stick | binary search data structures greedy probabilities sortings | Statement | D | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2000.0 | Codeforces round #716 editorial |