Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 5 6 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6672 | Heidi Learns Hashing (Easy) | brute force math number theory | Statement | A1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1200 | |
| 1154 | Heidi Learns Hashing (Medium) | brute force number theory | Statement | A2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2100 | |
| 7880 | Exam in BerSU (hard version) | brute force data structures greedy math | Statement | C2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1700 | |
| 2839 | Polycarp and Snakes | brute force implementation | Statement | E | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2000 | |
| 2310 | Two Pizzas | bitmasks brute force | Statement | F | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2200 | |
| 2350 | Tokitsukaze and Duel | brute force games greedy | Statement | C | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2400 | |
| 9913 | Tokitsukaze and Mahjong | brute force implementation | Statement | B | Codeforces Round 573 (Div. 2) {1191} | PROGRAMMING | 68314 | 1200 | |
| 19123 | Tokitsukaze and Enhancement | brute force | Statement | A | Codeforces Round 573 (Div. 2) {1191} | PROGRAMMING | 68314 | 700 | |
| 372 | Cubeword | *special brute force dp meet-in-the-middle | Statement | C | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 2114 | Count The Rectangles | bitmasks brute force data structures geometry sortings | Statement | E | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2200 | |
| 22256 | Sport Mafia | binary search brute force math | Statement | B | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 3422 | K-th Path | brute force constructive algorithms shortest paths sortings | Statement | F | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 2500 | |
| 29350 | Three Piles of Candies | brute force constructive algorithms math | Statement | A | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 700 | |
| 10190 | Welfare State | binary search brute force data structures sortings | Statement | B | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 1600 | |
| 22232 | Hotelier | brute force data structures implementation | Statement | A | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1000 | |
| 4483 | White Lines | brute force data structures dp implementation two pointers | Statement | D | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1900 | |
| 10087 | Compress Words | brute force hashing implementation string suffix structures strings | Statement | E | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2000 | |
| 1248 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 4868 | You Are Given a Decimal String... | brute force dp shortest paths | Statement | B | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1700 | |
| 2806 | You Are Given a WASD-string... | brute force data structures dp greedy implementation math strings | Statement | C | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2100 | |
| 2957 | You Are Given Some Strings... | brute force string suffix structures strings | Statement | E | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2500 | |
| 3310 | Kirk and a Binary String (easy version) | brute force greedy strings | Statement | D1 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2000 | |
| 7664 | Shortest Cycle | bitmasks brute force graphs shortest paths | Statement | B | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1900 | |
| 7179 | Remainder Problem | brute force data structures implementation | Statement | F | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2100 | |
| 23636 | There Are Two Types Of Burgers | brute force greedy implementation math | Statement | A | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 700 | |
| 11910 | Uniqueness | binary search brute force implementation two pointers | Statement | B | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1500 | |
| 3338 | Rotate Columns (easy version) | bitmasks brute force dp greedy sortings | Statement | E1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 5592 | Anadi and Domino | brute force graphs | Statement | A | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1600 | |
| 6133 | Marcin and Training Camp | brute force greedy | Statement | B | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1800 | |
| 504 | Marek and Matching (easy version) | brute force probabilities | Statement | F1 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2900 | |
| 530 | Marek and Matching (hard version) | brute force probabilities | Statement | F2 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 3100 | |
| 12234 | Equalizing by Division (easy version) | brute force implementation | Statement | D1 | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1500 | |
| 12438 | Equalizing by Division (hard version) | brute force math sortings | Statement | D2 | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1600 | |
| 5528 | Two Small Strings | brute force constructive algorithms | Statement | E | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 11553 | Badges | brute force math | Statement | B | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1100 | |
| 9547 | Optimal Currency Exchange | brute force math | Statement | A | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1300 | |
| 3799 | Numerical Sequence (easy version) | binary search brute force math | Statement | E1 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1900 | |
| 7925 | The Number Of Good Substrings | binary search bitmasks brute force | Statement | C | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 18376 | 2048 Game | brute force greedy math | Statement | A | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1000 | |
| 1055 | 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 | |
| 9951 | p-binary | bitmasks brute force math | Statement | C | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1600 | |
| 5477 | Complete Tripartite | brute force constructive algorithms graphs hashing implementation | Statement | D | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1800 | |
| 23465 | Distinct Digits | brute force implementation | Statement | A | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 800 | |
| 23124 | Dawid and Bags of Candies | brute force implementation | Statement | A | Codeforces Round 588 (Div. 2) {1230} | PROGRAMMING | 70008 | 800 | |
| 1774 | Alice and the Doll | brute force data structures greedy implementation | Statement | D | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2100 | |
| 17357 | Stones | brute force greedy math | Statement | A | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 800 | |
| 17915 | Rooms and Staircases | brute force implementation | Statement | B | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1000 | |
| 8439 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 8501 | The Football Season | brute force math number theory | Statement | C | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1900 | |
| 2447 | Daniel and Spring Cleaning | bitmasks brute force combinatorics dp | Statement | F | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 2574 | The World Is Just a Programming Task (Easy Version) | brute force dp greedy implementation | Statement | D1 | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1900 | |
| 16718 | Good Numbers (easy version) | brute force greedy implementation | Statement | C1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1300 | |
| 8480 | Data Center | brute force implementation | Statement | F | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1000 | ||
| 2835 | The Feast and the Bus | brute force constructive algorithms greedy math | Statement | B | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 240 | Show Must Go On | binary search brute force greedy shortest paths | Statement | I | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 21871 | Broken Keyboard | brute force strings two pointers | Statement | A | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1000 | |
| 822 | Tiling Terrace | brute force dp | Statement | J | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 2471 | Make Them Similar | bitmasks brute force hashing meet-in-the-middle | Statement | F | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2400 | |
| 2008 | Tournament | brute force dp greedy | Statement | E | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2400 | |
| 6087 | Beautiful Sequence | brute force constructive algorithms greedy | Statement | B | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1900 | |
| 1080 | Intriguing Selection | brute force constructive algorithms implementation interactive sortings | Statement | I | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2700 | |
| 965 | Invertation in Tournament | brute force divide and conquer graphs math | Statement | D | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 3100 | |
| 9773 | Modulo Equality | brute force sortings | Statement | B | Codeforces Round 609 (Div. 2) {1269} | PROGRAMMING | Codeforces Round #609 — Editorial | 1500 | |
| 24636 | Equation | brute force math | Statement | A | Codeforces Round 609 (Div. 2) {1269} | PROGRAMMING | Codeforces Round #609 — Editorial | 800 | |
| 11220 | Shawarma Tent | brute force geometry greedy implementation | Statement | C | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 323 | Divide The Students | brute force | Statement | F | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 3000 | |
| 15759 | Suits | brute force greedy math | Statement | A | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 900 | |
| 19688 | Remove One Element | brute force dp | Statement | D | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1500 | |
| 22282 | Three Friends | brute force greedy math sortings | Statement | A | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 900 | |
| 1805 | Beautiful Rectangle | brute force combinatorics constructive algorithms data structures greedy math | Statement | C | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2300 | |
| 18614 | Shuffle Hashing | brute force implementation strings | Statement | A | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1000 | |
| 14535 | Verse For Santa | binary search brute force implementation | Statement | B | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1300 | |
| 29135 | Fadi and LCM | brute force math number theory | Statement | C | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1400 | |
| 8825 | 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 | |
| 2039 | 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 | |
| 1630 | Madhouse (Easy version) | brute force constructive algorithms interactive math | Statement | C1 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2400 | |
| 777 | Madhouse (Hard version) | brute force constructive algorithms hashing interactive math | Statement | C2 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 542 | 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 | |
| 9924 | Hyperset | brute force data structures implementation | Statement | B | Codeforces Round 612 (Div. 2) {1287} | PROGRAMMING | Codeforces Round #612 - Editorial | 1500 | |
| 19499 | 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 | |
| 9046 | Mind Control | brute force data structures implementation | Statement | A | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1700 |
| 6849 | 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 |
| 16273 | 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 |
| 12702 | Anu Has a Function | brute force greedy math | Statement | A | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 500.0 | Codeforces Round #618 Editorial | 1500 |
| 80 | Keep talking and nobody explodes -- easy | bitmasks brute force expression parsing | Statement | F | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 3379 | Erase Subsequences | brute force dp greedy strings | Statement | E | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2200 | |
| 18978 | Longest Palindrome | brute force constructive algorithms greedy implementation strings | Statement | B | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1000.0 | Codeforces Round #620 (Div. 2) Editorial | 1100 |
| 20082 | Kuroni and Impossible Calculation | brute force combinatorics math number theory | Statement | C | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1250.0 | Ozon Tech Challenge 2020 Editorial | 1600 |
| 14776 | Kuroni and the Gifts | brute force constructive algorithms greedy sortings | Statement | A | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 500.0 | Ozon Tech Challenge 2020 Editorial | 800 |
| 12831 | Cow and Message | brute force dp math strings | Statement | C | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1500 |
| 2121 | Tourism | brute force dp graphs probabilities | Statement | D | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2300 |
| 17068 | Perform the Combo | brute force | Statement | C | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1300 | |
| 10091 | Three Integers | brute force math | Statement | D | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1900 | |
| 2970 | Construct the Binary Tree | brute force constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2400 | |
| 11209 | Skyscrapers (easy version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1500 |
| 16395 | Fast Food Restaurant | brute force greedy implementation | Statement | A | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 500.0 | Editorial | 900 |
| 11868 | String Modification | brute force constructive algorithms implementation sortings strings | Statement | B | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1000.0 | Codecraft-20 (Div.2) Editorial | 1400 |
| 10643 | Remove Adjacent | brute force greedy | Statement | C | Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round) {1321} | PROGRAMMING | 1250.0 | Codeforces Round #625 Editorial | |
| 21065 | Even Subset Sum Problem | brute force dp greedy implementation | Statement | A | Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics) {1323} | PROGRAMMING | 500.0 | Codeforces Round #626 Editorial | |
| 2448 | Ehab's REAL Number Theory Problem | brute force dfs and similar graphs number theory shortest paths | Statement | E | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2500.0 | 74235 | 2700 |
| 1092 | Wise Men (Easy Version) | bitmasks brute force dp meet-in-the-middle | Statement | F1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 2000.0 | 74961 | 2600 |
| 19768 | Princesses and Princes | brute force graphs greedy | Statement | B | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1300 | |
| 3609 | Infinite Path | brute force dfs and similar graphs math number theory | Statement | D | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2200 | |
| 607 | Elementary! | brute force dp strings | Statement | F | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 19388 | Composite Coloring | brute force constructive algorithms greedy math number theory | Statement | B | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1000.0 | Codeforces Round #630 Editorial | 1500 |
| 1850 | Road to 1600 | brute force constructive algorithms | Statement | E | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2000.0 | Codeforces Round #632 (Div. 2) editorial | |
| 4188 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 18263 | Circle of Monsters | brute force constructive algorithms greedy math | Statement | C | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 494 | Substring Search | brute force fft | Statement | G | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 11883 | Three Blocks Palindrome (easy version) | binary search brute force data structures dp two pointers | Statement | E1 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1700 | |
| 9617 | Three Blocks Palindrome (hard version) | brute force data structures dp two pointers | Statement | E2 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2000 | |
| 921 | Chiori and Doll Picking (easy version) | bitmasks brute force combinatorics math | Statement | E1 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1750.0 | Codeforces Round #635 Editorial | 2600 |
| 726 | Chiori and Doll Picking (hard version) | bitmasks brute force combinatorics math | Statement | E2 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 3400 |
| 3503 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial | |
| 34627 | Filling Diamonds | brute force dp | Statement | A | Codeforces Round 633 (Div. 2) {1339} | PROGRAMMING | 500.0 | Codeforces Round #633 Editorial | |
| 13731 | Nastya and Strange Generator | brute force data structures greedy implementation | Statement | A | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 500.0 | Codeforces Round #637 Editorial | |
| 843 | Nastya and CBS | brute force data structures hashing | Statement | F | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 3000.0 | Codeforces Round #637 Editorial | |
| 1178 | Make It Ascending | bitmasks brute force dp | Statement | F | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 2900 | |
| 13669 | Constant Palindrome Sum | brute force data structures greedy two pointers | Statement | D | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 1800 | |
| 5896 | Weights Distributing | brute force graphs greedy shortest paths sortings | Statement | E | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 2400 | |
| 1429 | Restore the Permutation by Sorted Segments | brute force constructive algorithms data structures greedy implementation | Statement | F | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 2800 | |
| 54440 | Candies | brute force math | Statement | A | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 900 | |
| 28554 | Card Constructions | binary search brute force dp math | Statement | B | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 1100 |
| 18755 | Square? | brute force implementation math | Statement | B | Testing Round 16 (Unrated) {1351} | PROGRAMMING | 1000.0 | 900 | |
| 24700 | Special Elements | brute force implementation two pointers | Statement | E | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1500 | |
| 7985 | K-periodic Garland | brute force dp greedy | Statement | E | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1900 | |
| 3729 | Decreasing Heights | brute force dp | Statement | F | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 2200 | |
| 6441 | Not So Simple Polygon Embedding | binary search brute force geometry math | Statement | C2 | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2000 | |
| 29286 | Sequence with Digits | brute force implementation math | Statement | A | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 750.0 | Codeforces Round #643 (Div. 2) Editorial | 1200 |
| 8847 | The Best Vacation | binary search brute force greedy implementation two pointers | Statement | D | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 1500.0 | Codeforces Round #645 (Div. 2) Editorial | 1900 |
| 29646 | New Theatre Square | brute force dp greedy implementation two pointers | Statement | B | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 32093 | Berland Poker | brute force greedy math | Statement | A | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 632 | RC Kaboom Show | binary search brute force data structures geometry math | Statement | F | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2900 | |
| 13774 | Spy-string | bitmasks brute force constructive algorithms dp hashing strings | Statement | F | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1700 | |
| 4942 | Binary Median | bitmasks brute force constructive algorithms | Statement | H | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 2100 | |
| 21435 | Johnny and His Hobbies | bitmasks brute force | Statement | B | Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! {1362} | PROGRAMMING | 1000.0 | Codeforces Round #647 Editorial | 1200 |
| 41530 | Odd Selection | brute force implementation math | Statement | A | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 500.0 | 78202 | 1200 |
| 32101 | XXXXX | brute force data structures number theory two pointers | Statement | A | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 750.0 | Codeforces round #649 editorial | 1200 |
| 14585 | Ehab and Prefix MEXs | brute force constructive algorithms greedy | Statement | C | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 1500.0 | Codeforces round #649 editorial | 1600 |
| 8499 | Maximum Subsequence Value | brute force constructive algorithms | Statement | E | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #648 | 1900 |
| 4691 | Two Arrays | binary search brute force combinatorics dp greedy implementation two pointers | Statement | E | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 5948 | Necklace Assembly | binary search brute force dp greedy number theory | Statement | E | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 21935 | Codeforces Subsequences | brute force constructive algorithms greedy math strings | Statement | B | Codeforces Global Round 8 {1368} | PROGRAMMING | 1000.0 | Codeforces Global Round 8: editorial | |
| 47476 | C+= | brute force greedy math | Statement | A | Codeforces Global Round 8 {1368} | PROGRAMMING | 500.0 | Codeforces Global Round 8: editorial | |
| 25426 | GCD Compression | brute force constructive algorithms math number theory | Statement | B | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #651 | |
| 67678 | Maximum GCD | brute force greedy implementation number theory | Statement | A | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #651 | |
| 5561 | Asterism (Easy Version) | brute force combinatorics implementation math number theory sortings | Statement | E1 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 5950 | Omkar and Circle | brute force constructive algorithms dp games greedy | Statement | D | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2000.0 | Codeforces Round #655 Editorial | 2100 |
| 56941 | 01 Game | brute force constructive algorithms dp games implementation strings | Statement | B | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 2999 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 1435 | Cyclic Shifts Sorting | brute force constructive algorithms implementation | Statement | F | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 2590 | Integer Game | brute force constructive algorithms games interactive math | Statement | F | Codeforces Global Round 9 {1375} | PROGRAMMING | 2000.0 | 79731 | |
| 10310 | Replace by MEX | brute force constructive algorithms implementation | Statement | D | Codeforces Global Round 9 {1375} | PROGRAMMING | 1750.0 | 79731 | |
| 13248 | Dubious Cyrpto | binary search brute force math number theory | Statement | B | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 750.0 | Codeforces Round #657 Editorial | 1500 |
| 12420 | Acacius and String | brute force implementation strings | Statement | A | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 500.0 | Codeforces Round #657 Editorial | 1500 |
| 1178 | New Passenger Trams | brute force data structures sortings two pointers | Statement | D | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2400 |
| 43850 | Three Indices | brute force | Statement | A | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 5095 | Berserk And Fireball | brute force greedy math | Statement | D | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 27527 | Common Subsequence | brute force | Statement | A | Codeforces Round 658 (Div. 2) {1382} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 800 |
| 871 | Rearrange | brute force constructive algorithms graphs greedy sortings | Statement | D | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 22494 | a-Good String | bitmasks brute force divide and conquer dp implementation | Statement | D | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1500 | |
| 26087 | Captain Flint and Crew Recruitment | brute force math number theory | Statement | A | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 750.0 | Codeforces Round #660 Editorial | 800 |
| 4600 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 20866 | Good String | brute force dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 5912 | 505 | bitmasks brute force dp implementation | Statement | D | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2000.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 30321 | Fix You | brute force greedy implementation | Statement | B | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 7175 | Boboniu Chats with Du | brute force dp greedy sortings two pointers | Statement | A | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1800 |
| 2185 | Boboniu Walks on Graph | brute force graphs hashing implementation meet-in-the-middle | Statement | B | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 2300 |
| 25722 | Boboniu Likes to Color Balls | brute force | Statement | A | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1000 |
| 15467 | Boboniu and Bit Operations | bitmasks brute force dp | Statement | C | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 1600 |
| 13353 | Stoned Game | brute force constructive algorithms games greedy | Statement | B | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 15590 | Power Sequence | binary search brute force math number theory ternary search | Statement | B | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 33629 | Boats Competition | brute force | Statement | C | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 11779 | RPG Protagonist | binary search brute force greedy math | Statement | B | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 28088 | String Similarity | brute force constructive algorithms strings | Statement | A | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11580 | Zigzags | brute force data structures dp math two pointers | Statement | D | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 2002 | 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 | |
| 24862 | 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 | |
| 18267 | Big Vova | brute force greedy math number theory | Statement | B | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 1000.0 | Codeforces Round #669 Editorial | |
| 4753 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 31336 | Minimum Product | brute force greedy math | Statement | B | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 24901 | Yet Another Array Restoration | brute force math | Statement | C | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 33275 | 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 | |
| 6290 | 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) | |
| 12605 | 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) | |
| 15946 | 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) | |
| 11865 | 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) | |
| 17133 | 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 | |
| 1112 | Battle Lemmings | brute force dp geometry | Statement | E | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 3000.0 | Editorial | |
| 1039 | Swedish Heroes | brute force dp implementation | Statement | E | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 2500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 4404 | Hexagons | brute force implementation math shortest paths ternary search | Statement | D | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 2000.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 8234 | Rock, Paper, Scissors | brute force constructive algorithms flows greedy math | Statement | E | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1800 | |
| 6189 | The Hard Work of Paparazzi | brute force dp | Statement | C | Codeforces Global Round 11 {1427} | PROGRAMMING | 1000.0 | Editorial of Global Round 11 | 2000 |
| 22008 | Number of Apartments | brute force dp math | Statement | A | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 82 | Rogue-like Game | *special brute force greedy | Statement | H | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 18527 | Marketing Scheme | brute force constructive algorithms greedy math | Statement | A | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 1506 | Yurii Can Do Everything | brute force divide and conquer greedy implementation | Statement | E | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 2250.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 1697 | Graph Subset Problem | brute force data structures graphs | Statement | B | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 1250.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 5486 | Identify the Operations | brute force combinatorics data structures dsu greedy implementation | Statement | B | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1000.0 | 84298 | |
| 1592 | Long Permutation | brute force combinatorics math | Statement | E | Codeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final) {1443} | PROGRAMMING | 2500.0 | VK Cup 2019-2020 -- Engine Editorial | |
| 172 | Finding the Vertex | brute force dfs and similar dp interactive trees | Statement | E | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 3000.0 | Codeforces Round #680 Editorial | |
| 16150 | Balls of Steel | brute force geometry greedy | Statement | B | Codeforces Global Round 12 {1450} | PROGRAMMING | 750.0 | Codeforces Global Round 12 Editorial | |
| 1767 | Two Editorials | brute force data structures greedy implementation | Statement | E | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 4495 | Checkpoints | brute force constructive algorithms greedy math probabilities | Statement | D | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2000.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 5002 | Array Partition | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 1689 | Four Points | brute force constructive algorithms flows geometry greedy math ternary search | Statement | E | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 10448 | Divide and Summarize | binary search brute force data structures divide and conquer implementation sortings | Statement | D | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1500.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 13420 | Find the Spruce | brute force dp | Statement | B | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1000.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 2251 | Water Level | brute force graphs greedy implementation math | Statement | E | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2250.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 23290 | Bovine Dilemma | brute force math | Statement | A | Good Bye 2020 {1466} | PROGRAMMING | 500.0 | Good Bye 2020 Editorial | |
| 11637 | Hills And Valleys | brute force implementation | Statement | B | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1000.0 | Codeforces Round #695 (Div. 2) Editorial | 1700 |
| 6869 | Three Bags | brute force constructive algorithms greedy | Statement | C | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1500.0 | Codeforces Round #695 (Div. 2) Editorial | 1900 |
| 5663 | The Robot | brute force implementation | Statement | K | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 2259 | A Bit Similar | bitmasks brute force hashing string suffix structures strings two pointers | Statement | E | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 10326 | Ceil Divisions | brute force constructive algorithms math number theory | Statement | D | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 1486 | Strange Shuffle | binary search brute force constructive algorithms interactive probabilities | Statement | C | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 1000.0 | 86464 | |
| 6845 | Strange Definition | bitmasks brute force data structures graphs math number theory | Statement | B | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 750.0 | 86464 | |
| 20050 | Strange List | brute force greedy implementation math | Statement | B | Codeforces Round 694 (Div. 2) {1471} | PROGRAMMING | 750.0 | Codeforces Round #694 Editorial | |
| 3339 | New Year's Puzzle | brute force dp graph matchings greedy sortings | Statement | F | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 35716 | String LCM | brute force math strings | Statement | B | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 58966 | New Year's Number | brute force dp math | Statement | B | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 21892 | Inflation | binary search brute force greedy math | Statement | B | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 19105 | Nezzar and Lucky Number | brute force dp math | Statement | B | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 28248 | Nezzar and Colorful Balls | brute force greedy | Statement | A | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 12517 | Fence Painting | brute force constructive algorithms greedy implementation | Statement | C | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 1500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 20026 | New Colony | brute force greedy implementation | Statement | B | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 750.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 36107 | Add and Divide | brute force greedy math ternary search | Statement | A | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1000 |
| 11246 | Floor and Mod | binary search brute force data structures math number theory | Statement | C | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1700 |
| 15604 | Minimum Ties | brute force constructive algorithms dfs and similar graphs greedy implementation math | Statement | C | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 513 | Two Policemen | *special binary search brute force math | Statement | C | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 39912 | Sum of Cubes | binary search brute force brute force math | Statement | C | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 28159 | Balanced Remainders | brute force constructive algorithms math | Statement | B | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 110 | Ruler Of The Zoo | brute force | Statement | I | Codeforces Global Round 13 {1491} | PROGRAMMING | 5000.0 | Codeforces Global Round 13 Editorial | |
| 8473 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 2436 | Fib-tree | brute force divide and conquer trees | Statement | E | Codeforces Global Round 13 {1491} | PROGRAMMING | 1750.0 | Codeforces Global Round 13 Editorial | |
| 19157 | K-th Largest Value | brute force greedy implementation | Statement | A | Codeforces Global Round 13 {1491} | PROGRAMMING | 500.0 | Codeforces Global Round 13 Editorial | |
| 14324 | Minimal Cost | brute force greedy implementation math | Statement | B | Codeforces Global Round 13 {1491} | PROGRAMMING | 750.0 | Codeforces Global Round 13 Editorial | |
| 1336 | Almost Fault-Tolerant Database | brute force constructive algorithms dfs and similar greedy implementation | Statement | E | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 3000.0 | Codeforces Round #704 Editorial | |
| 5018 | K-beautiful Strings | binary search brute force greedy implementation strings | Statement | C | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 1750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 12646 | Planet Lapituletti | brute force implementation | Statement | B | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 1250.0 | Codeforces Round #705 (Div.2) Editorial | |
| 15512 | Berland Crossword | binary search bitmasks brute force greedy implementation | Statement | B | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 23101 | ABC String | bitmasks brute force implementation | Statement | A | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 2879 | Dogeforces | brute force constructive algorithms divide and conquer dsu greedy implementation trees | Statement | D | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 549 | Qingshan and Daniel | brute force data structures greedy implementation | Statement | E | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2500.0 | Codeforces Round #706 Editorial | |
| 22467 | Split it! | brute force constructive algorithms greedy strings | Statement | A | Codeforces Round 706 (Div. 2) {1496} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 26515 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 12728 | 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 | |
| 2192 | 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 | |
| 24981 | 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 | |
| 13572 | 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 |