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 ... 75 76 77 78 79 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 210 | Special Positions | combinatorics fft | Statement | E | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 2250.0 | Codeforces Round #773 editorial | |
| 3867 | Repetitions Decoding | constructive algorithms implementation sortings | Statement | B | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 18111 | Great Sequence | brute force greedy sortings | Statement | A | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 500.0 | Codeforces Round #773 editorial | |
| 104 | Covering Circle | geometry | Statement | F | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 3000.0 | Codeforces Round #773 editorial | |
| 2539 | Anonymity Is Important | binary search data structures ds sortings | Statement | C | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1250.0 | Codeforces Round #773 editorial | |
| 17155 | Power Walking | greedy | Statement | B | Codeforces Round 773 (Div. 2) {1642} | PROGRAMMING | 750.0 | Codeforces Round #773 editorial | |
| 16288 | Hard Way | geometry | Statement | A | Codeforces Round 773 (Div. 2) {1642} | PROGRAMMING | 500.0 | Codeforces Round #773 editorial | |
| 13982 | Increase Subarray Sums | dp implementation | Statement | C | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 3159 | Expand the Path | brute force combinatorics implementation math | Statement | E | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 27571 | Doors and Keys | implementation | Statement | A | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 7394 | Cross Coloring | implementation math | Statement | D | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 332 | Basis | combinatorics fft math number theory | Statement | F | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 20826 | Anti-Fibonacci Permutation | brute force constructive algorithms implementation | Statement | B | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 14761 | Factorials and Powers of Two | bitmasks brute force constructive algorithms math | Statement | C | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1250.0 | Codeforces Round #774 (Div. 2) Editorial | 1500 |
| 3899 | Weight the Tree | constructive algorithms dfs and similar dp implementation trees | Statement | D | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2000.0 | Codeforces Round #774 (Div. 2) Editorial | 2000 |
| 2509 | Power Board | brute force math number theory | Statement | E | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2500.0 | Codeforces Round #774 (Div. 2) Editorial | 2200 |
| 547 | Playing Around the Table | constructive algorithms greedy implementation | Statement | F | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 3000.0 | Codeforces Round #774 (Div. 2) Editorial | 2900 |
| 24484 | Square Counting | math | Statement | A | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 750.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 21412 | Quality vs Quantity | brute force constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1000.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 1008 | Madoka and the Sixth-graders | dfs and similar greedy trees | Statement | E | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2500.0 | Codeforces Round #777 Editorial | |
| 15619 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 5381 | Madoka and the Best School in Russia | dp math number theory | Statement | D | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2000.0 | Codeforces Round #777 Editorial | |
| 22928 | Madoka and Math Dad | implementation math | Statement | A | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 500.0 | Codeforces Round #777 Editorial | |
| 468 | Madoka and Laziness | dp greedy | Statement | F | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 3000.0 | Codeforces Round #777 Editorial | |
| 12797 | Madoka and Childish Pranks | constructive algorithms greedy | Statement | C | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1500.0 | Codeforces Round #777 Editorial | |
| 13560 | Weird Sum | combinatorics data structures geometry math matrices sortings | Statement | A | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 500.0 | Codeforces Round #775 Editorial | |
| 3027 | Tyler and Strings | combinatorics data structures implementation strings | Statement | C | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1500.0 | Codeforces Round #775 Editorial | |
| 142 | Two Avenues | data structures dfs and similar graphs | Statement | F | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 3750.0 | Codeforces Round #775 Editorial | |
| 898 | Serious Business | data structures divide and conquer dp shortest paths | Statement | D | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2000.0 | Codeforces Round #775 Editorial | |
| 6594 | Integral Array | brute force constructive algorithms data structures math | Statement | B | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 421 | Air Reform | data structures dfs and similar divide and conquer ds graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 13257 | Game of Ball Passing | greedy implementation | Statement | B | Codeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics) {1649} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 15655 | Game | implementation | Statement | A | Codeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics) {1649} | PROGRAMMING | 500.0 | Codeforces Round #775 Editorial | |
| 17001 | Weight of the System of Nested Segments | greedy hashing implementation sortings | Statement | C | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 1514 | Vitaly and Advanced Useless Algorithms | dp greedy | Statement | F | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 13215 | Twist the Permutation | brute force constructive algorithms math | Statement | D | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 4210 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 28149 | DIV + MOD | math | Statement | B | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 35236 | Deletions of Two Adjacent Letters | implementation strings | Statement | A | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 2576 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 388 | Tower Defense | binary search brute force data structures | Statement | F | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 530 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 19780 | Prove Him Wrong | constructive algorithms greedy | Statement | B | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 25864 | Playoff | implementation | Statement | A | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 5300 | Nearest Excluded Points | binary search data structures dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 10917 | Fault-tolerant Network | brute force data structures implementation | Statement | C | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 13702 | Alice and the Cake | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 1400 |
| 2883 | Potion Brewing Class | dfs and similar implementation math number theory trees | Statement | D | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2100 |
| 2132 | Arithmetic Operations | brute force divide and conquer graphs math | Statement | E | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2300 |
| 1231 | Minimal String Xoration | bitmasks data structures divide and conquer hashing strings | Statement | F | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2800 |
| 411 | Snowy Mountain | data structures graphs greedy shortest paths trees | Statement | G | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2900 |
| 82 | Three Minimums | combinatorics fft math | Statement | H | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 3500 |
| 15700 | Prefix Removals | strings | Statement | B | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 800 |
| 18762 | Maximum Cake Tastiness | greedy implementation sortings | Statement | A | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 800 |
| 19880 | Subtract Operation | constructive algorithms data structures math two pointers | Statement | B | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1000.0 | Tutorial | |
| 1081 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 106 | Neighbour Ordering | constructive algorithms graphs | Statement | I | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 4500.0 | Tutorial | |
| 19584 | Make Equal With Mod | math number theory sortings | Statement | C | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1500.0 | Tutorial | |
| 6992 | K-good | constructive algorithms games math number theory | Statement | D | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2000.0 | Tutorial | |
| 19810 | Good Pairs | constructive algorithms math sortings | Statement | A | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 500.0 | Tutorial | |
| 3543 | Equal Tree Sums | constructive algorithms dfs and similar trees | Statement | E | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2500.0 | Tutorial | |
| 598 | Equal LCM Subsets | math number theory | Statement | H | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3750.0 | Tutorial | |
| 396 | Cycle Palindrome | constructive algorithms math | Statement | G | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3250.0 | Tutorial | |
| 22994 | XY Sequence | greedy | Statement | B | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 590 | Words on Tree | 2-sat implementation trees | Statement | F | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 2173 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 24184 | Integer Moves | math | Statement | A | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 4988 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 16988 | Bracket Sequence Deletion | greedy hashing | Statement | C | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 9495 | Shinju and the Lost Permutation | constructive algorithms math | Statement | C | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 20437 | Marin and Photoshoot | constructive algorithms math | Statement | A | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 18754 | Marin and Anti-coprime Permutation | combinatorics math | Statement | B | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1000.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 789 | Juju and Binary String | brute force constructive algorithms math | Statement | F | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 3000.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 1083 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 2620 | 388535 (Hard Version) | bitmasks brute force data structures math | Statement | D2 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 9266 | 388535 (Easy Version) | bitmasks data structures math | Statement | D1 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1250.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 199 | Tree and Permutation Game | dfs and similar games trees | Statement | F | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 3000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 4093 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 20024 | Red Versus Blue | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 11061 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 11133 | Bit Flipping | bitmasks constructive algorithms greedy strings | Statement | B | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 750.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 1654 | AND-MEX Walk | bitmasks brute force data structures dfs and similar ds graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 28371 | Vlad and Candies | math | Statement | B | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 36568 | Vasya and Coins | math | Statement | A | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 2806 | Promising String (hard version) | data structures implementation math strings | Statement | F2 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 7432 | Promising String (easy version) | brute force implementation math strings | Statement | F1 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 8995 | Maximum Product Strikes Back | binary search implementation math | Statement | D | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 7494 | Matrix and Shifts | constructive algorithms greedy implementation | Statement | E | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 19980 | Get an Even String | dp greedy strings | Statement | C | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 9580 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 628 | Teleporters | binary search greedy math | Statement | F | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 4852 | Progressions Covering | data structures greedy implementation | Statement | D | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 977 | Narrow Components | data structures dfs and similar ds trees | Statement | E | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 18274 | Getting Zero | brute force dfs and similar graphs greedy shortest paths | Statement | B | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 18515 | Array Balancing | greedy math | Statement | A | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 245 | Training Camp | flows graphs | Statement | J | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 141 | Toys | greedy greedy strings strings | Statement | B | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 149 | Round Table | math | Statement | E | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 342 | Pandemic Restrictions | geometry ternary search | Statement | K | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 4500 | Organizing SWERC | Statement | A | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 |