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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 18703 | Longest Regular Bracket Sequence | constructive algorithms data structures dp greedy sortings strings | Statement | C | Codeforces Beta Round 5 {5} | PROGRAMMING | C, D и E с CBR5 - разбор | 1900 | |
| 945 | Tricky and Clever Password | binary search constructive algorithms data structures greedy hashing strings | Statement | E | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Tutorial for problem A | 2700 | |
| 2484 | Suspects | constructive algorithms data structures implementation | Statement | B | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | Codeforces Round 110 — Разбор задач | 1800 | |
| 13299 | Little Elephant and Array | constructive algorithms data structures | Statement | B | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 1900 | |
| 11875 | Escape from Stones | constructive algorithms data structures implementation two pointers | Statement | A | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 1400 | |
| 6892 | Cows and Sequence | constructive algorithms data structures implementation | Statement | A | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 1600 | |
| 627 | Ilya and Two Numbers | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2300 | |
| 629 | Biathlon Track | binary search brute force constructive algorithms data structures dp | Statement | D | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2200 | |
| 7885 | Interesting Array | constructive algorithms data structures trees | Statement | B | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2000 | |
| 3152 | Sign on Fence | binary search constructive algorithms data structures | Statement | E | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2700 | |
| 6089 | Misha and Forest | constructive algorithms data structures greedy sortings trees | Statement | C | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1700 | |
| 402 | Constrained Tree | constructive algorithms data structures | Statement | D2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2500 | |
| 6395 | Anya and Smartphone | constructive algorithms data structures implementation | Statement | C | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | 1600 | ||
| 2286 | Arthur and Walls | constructive algorithms data structures graphs greedy shortest paths | Statement | D | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2300 | |
| 2580 | Handshakes | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2000 | ||
| 340 | Listening to Music | constructive algorithms data structures | Statement | E | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 3200 | |
| 9601 | Replacement | constructive algorithms data structures implementation | Statement | C | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 1600 | |
| 3885 | Lazy Student | constructive algorithms data structures graphs | Statement | B | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | Codeforces Round #335 Problem Analysis | 1800 | |
| 1759 | Vika and Segments | constructive algorithms data structures geometry two pointers | Statement | D | Codeforces Round 337 (Div. 2) {610} | PROGRAMMING | Codeforces Round #337 (Div.2) Editorial | 2300 | |
| 644 | Startup Funding | binary search constructive algorithms data structures probabilities two pointers | Statement | E | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2400 | |
| 24229 | Chat Order | *special binary search constructive algorithms data structures sortings | Statement | B | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 2855 | Processing Queries | *special constructive algorithms data structures two pointers | Statement | B | CROC 2016 - Qualification {644} | PROGRAMMING | 2200 | ||
| 3888 | Money Transfers | constructive algorithms data structures greedy sortings | Statement | C | Codeforces Round 353 (Div. 2) {675} | PROGRAMMING | Tutorial | 2000 | |
| 10679 | Heap Operations | constructive algorithms data structures greedy | Statement | C | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 45425 | 1600 | |
| 2514 | Maxim and Array | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 2000 | |
| 2403 | Subordinates | constructive algorithms data structures graphs greedy sortings | Statement | E | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 2000 | |
| 1104 | Sleep in Class | constructive algorithms data structures math two pointers | Statement | E | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 2500 | |
| 2080 | Santa Claus and a Palindrome | constructive algorithms data structures greedy | Statement | D | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2000 | |
| 3574 | Mahmoud and a xor trip | bitmasks constructive algorithms data structures dfs and similar dp math trees | Statement | E | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2200 | |
| 531 | Sherlock's bet to Moriarty | constructive algorithms data structures divide and conquer geometry graphs implementation trees | Statement | F | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2700 | |
| 3244 | Bank Hacking | constructive algorithms data structures dp trees | Statement | C | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 1900 | |
| 558 | Mike and code of a permutation | constructive algorithms data structures graphs sortings | Statement | E | Codeforces Round 410 (Div. 2) {798} | PROGRAMMING | Codeforces Round #410 (Div. 2) Editorial | 2700 | |
| 2853 | Leha and another game about graph | constructive algorithms data structures dfs and similar dp graphs | Statement | B | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2100 | |
| 2014 | Rooter's Song | constructive algorithms data structures geometry implementation sortings two pointers | Statement | B | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2100 | |
| 8350 | Buy Low Sell High | constructive algorithms data structures greedy | Statement | D | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2300 | |
| 6025 | Xor-MST | bitmasks constructive algorithms data structures | Statement | G | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2300 | |
| 2888 | Stack Sorting | constructive algorithms data structures greedy implementation | Statement | E | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | 2000 | ||
| 4321 | Array Restoration | constructive algorithms data structures | Statement | D | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 1700 | |
| 889 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 3875 | Tree Reconstruction | constructive algorithms data structures graphs greedy | Statement | E | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1900 | |
| 1280 | Vasya and Maximum Profit | binary search constructive algorithms data structures dp dsu | Statement | G | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 2295 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 1047 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 3903 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 1794 | 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 | |
| 1247 | The Cake Is a Lie | constructive algorithms data structures dfs and similar graphs | Statement | E | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2400 | |
| 14257 | Friends and Gifts | constructive algorithms data structures math | Statement | C | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1500 | |
| 2023 | 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 | |
| 5652 | 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 | |
| 7359 | 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 |
| 4702 | Present | binary search bitmasks constructive algorithms data structures math sortings | Statement | B | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 1822 | Drazil Likes Heap | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 1500.0 | Codeforces Round #631 Editorial | 2400 |
| 550 | Dreamoon Likes Strings | constructive algorithms data structures | Statement | D | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 2000.0 | Codeforces Round #631 Editorial | 3000 |
| 6387 | Multiple Testcases | binary search constructive algorithms data structures greedy sortings two pointers | Statement | D | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1900 | |
| 1425 | 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 | |
| 27749 | Phoenix and Beauty | constructive algorithms data structures greedy | Statement | B | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 1000.0 | Codeforces Round #638 (Div. 2) Editorial | 1400 |
| 20543 | Constructing the Array | constructive algorithms data structures sortings | Statement | D | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1600 | |
| 2472 | Are You Fired? | constructive algorithms data structures dp greedy implementation | Statement | E | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2000.0 | Codeforces Round #645 (Div. 2) Editorial | 2400 |
| 5059 | Ehab's Last Corollary | constructive algorithms data structures dfs and similar dp graphs implementation trees | Statement | D | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 2000.0 | Codeforces round #649 editorial | 2100 |
| 25161 | Rotation Matching | constructive algorithms data structures greedy implementation | Statement | C | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #648 | 1400 |
| 2482 | DeadLee | constructive algorithms data structures graphs greedy implementation sortings | Statement | E | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2500.0 | Codeforces Round #652 (Div. 2) Editorial | 2400 |
| 521 | Set Merging | constructive algorithms data structures divide and conquer | Statement | H | Codeforces Global Round 9 {1375} | PROGRAMMING | 2750.0 | 79731 | |
| 21858 | Prefix Flip (Easy Version) | constructive algorithms data structures strings | Statement | A1 | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 1300 |
| 14471 | Prefix Flip (Hard Version) | constructive algorithms data structures strings two pointers | Statement | A2 | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 1700 |
| 11089 | Pinkie Pie Eats Patty-cakes | binary search constructive algorithms data structures greedy math sortings | Statement | C | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 20038 | Binary String To Subsequences | constructive algorithms data structures greedy | Statement | D | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 17751 | Non-zero Segments | constructive algorithms data structures greedy | Statement | D | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 1500 | |
| 28677 | Numbers on Whiteboard | constructive algorithms data structures games implementation math | Statement | C | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 14308 | Array Destruction | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 1500.0 | Codeforces Round #696 Editorial | |
| 7516 | Painting the Array I | constructive algorithms data structures dp greedy implementation | Statement | B1 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 2087 | A-Z Graph | constructive algorithms data structures graphs | Statement | E | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 512 | Squares | constructive algorithms data structures graphs trees | Statement | F | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 3250.0 | Codeforces Round #706 Editorial | |
| 1297 | Flip the Cards | 2-sat constructive algorithms data structures dsu greedy sortings | Statement | D | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1750.0 | T | 2600 |
| 237 | 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 |
| 14327 | Restoring the Permutation | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 24815 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 1465 | 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 | |
| 6640 | GCD and MST | constructive algorithms data structures dsu 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 | |
| 18933 | Phoenix and Towers | constructive algorithms data structures greedy | Statement | C | Codeforces Global Round 14 {1515} | PROGRAMMING | 1500.0 | Editorial | |
| 2371 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 2833 | Kill Anton | brute force constructive algorithms data structures math strings | Statement | D | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2250.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 2332 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 1089 | Game with Cards | binary search constructive algorithms data structures dp implementation | Statement | E | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2000.0 | tutorial | 2500 |
| 7142 | Array Stabilization (GCD version) | binary search constructive algorithms data structures number theory two pointers | Statement | F | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 16778 | Wonderful Coloring - 2 | binary search constructive algorithms data structures greedy | Statement | B2 | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 2146 | Colors and Intervals | constructive algorithms data structures greedy sortings | Statement | E | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 2276 | Two Hundred Twenty One (hard version) | binary search constructive algorithms data structures dp math | Statement | D2 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 422 | Four Vertices | constructive algorithms data structures graphs greedy implementation shortest paths | Statement | G | Codeforces Global Round 16 {1566} | PROGRAMMING | 3000.0 | Codeforces Global Round 16 Editorial | |
| 126 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 1608 | Red-Blue Matrix | constructive algorithms data structures hashing implementation sortings two pointers | Statement | D | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 10328 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 2246 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 7368 | 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 | |
| 14635 | 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 |
| 28142 | 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 | |
| 4479 | 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 | |
| 3683 | MEX vs DIFF | brute force constructive algorithms data structures greedy two pointers | Statement | E | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2100 |
| 1716 | Sanae and Giant Robot | brute force constructive algorithms data structures dfs and similar dsu | Statement | C | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 7688 | Max GEQ Sum | binary search constructive algorithms data structures divide and conquer implementation sortings two pointers | Statement | D | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 6059 | Permutation Graph | binary search constructive algorithms data structures greedy shortest paths trees | Statement | D | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 15905 | awoo's Favorite Problem | constructive algorithms data structures dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 9575 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 1266 | House Planning | constructive algorithms data structures flows graph matchings greedy | Statement | E | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 2250.0 | Codeforces Round #824 — editorial | |
| 9142 | Knowledge Cards | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 1750.0 | Tutorial | 1500 |
| 5130 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 5657 | Yet Another Problem | binary search bitmasks constructive algorithms data structures | Statement | D | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1750.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 10530 | Complementary XOR | constructive algorithms data structures | Statement | C | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 125 | BinaryStringForces | constructive algorithms data structures | Statement | H | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 10638 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 671 | Segment Covering | brute force combinatorics constructive algorithms data structures trees | Statement | G | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 3250.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 9138 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 2079 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 35013 | Dora and Search | constructive algorithms data structures two pointers | Statement | C | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1250.0 | Codeforces Round #852 Editorial | |
| 139 | Copium Permutation | constructive algorithms data structures greedy | Statement | F | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 3500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3500 |
| 5622 | Survey in Class | constructive algorithms data structures greedy implementation sortings | Statement | D | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1750.0 | Codeforces Round #879 Editorial | |
| 23083 | Bracket Coloring | constructive algorithms data structures greedy | Statement | D | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 3751 | Bracket Walk | constructive algorithms data structures implementation sortings strings | Statement | D | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1750.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1202 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 237 | Rivalries | constructive algorithms data structures | Statement | E | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 3235 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 12974 | Kolya and Movie Theatre | constructive algorithms data structures greedy | Statement | E | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 3111 | Guess Game | bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees | Statement | E | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 12791 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 361 | Ball-Stackable | constructive algorithms data structures dp trees | Statement | E | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 2337 | Minimum Array | constructive algorithms data structures two pointers | Statement | C | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 1000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 7224 | XOR Construction | bitmasks constructive algorithms data structures math trees | Statement | D | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 5826 | Set To Max (Hard Version) | binary search constructive algorithms data structures dsu greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 4714 | Cyclic MEX | binary search constructive algorithms data structures implementation math two pointers | Statement | D | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 115 | Parallel Swaps Sort | constructive algorithms data structures | Statement | H | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 6000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 13379 | Heavy Intervals | constructive algorithms data structures dsu greedy math sortings | Statement | C | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 27387 | Minimize Inversions | constructive algorithms data structures greedy implementation sortings | Statement | B | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 18735 | Find B | constructive algorithms data structures greedy | Statement | C | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 8226 | Lexicographically Largest | constructive algorithms data structures greedy sortings | Statement | C | think-cell Round 1 {1930} | PROGRAMMING | 1500.0 | think-cell Round 1 Editorial | |
| 9898 | Messenger in MAC | binary search brute force constructive algorithms data structures dp sortings | Statement | C | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 177 | Almost Certainly | *special constructive algorithms data structures sortings | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 941 | Cook and Porridge | binary search constructive algorithms data structures implementation | Statement | G | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 1002 | Inversion Composition | binary search constructive algorithms data structures greedy | Statement | F | Codeforces Global Round 25 {1951} | PROGRAMMING | 2750.0 | Codeforces Global Round 25 Editorial | |
| 32727 | Progressive Square | constructive algorithms data structures implementation sortings | Statement | B | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 689 | Nene and the Passing Game | constructive algorithms data structures dsu graphs sortings | Statement | F | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 2500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 1852 | Manhattan Triangle | binary search constructive algorithms data structures geometry graphs two pointers | Statement | E | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 13218 | Permutation of Rows and Columns | constructive algorithms data structures hashing math matrices sortings | Statement | E | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 1215 | Catch the Mole(Easy Version) | binary search constructive algorithms data structures interactive trees | Statement | E1 | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 10420 | Squaring | brute force constructive algorithms data structures greedy implementation math number theory | Statement | C | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 5170 | DFS Checker (Easy Version) | constructive algorithms data structures dfs and similar hashing implementation | Statement | D1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 2924 | DFS Checker (Hard Version) | constructive algorithms data structures dfs and similar hashing implementation trees | Statement | D2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 653 | Turtle and Inversions (Hard Version) | brute force constructive algorithms data structures dp greedy two pointers | Statement | E2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 4586 | Adjust The Presentation (Hard Version) | constructive algorithms data structures greedy implementation | Statement | C2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 3814 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 4000 | Cool Graph | constructive algorithms data structures dfs and similar dsu graphs trees | Statement | D | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 6320 | Genokraken | binary search constructive algorithms data structures graphs interactive trees two pointers | Statement | D | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 1424 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 11733 | Alya and Permutation | bitmasks constructive algorithms data structures | Statement | C | Codeforces Global Round 27 {2035} | PROGRAMMING | 1000.0 | Codeforces Global Round 27 Editorial | |
| 142 | Yandex Cuneiform (Easy Version) | constructive algorithms data structures greedy | Statement | F1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 109 | Yandex Cuneiform (Hard Version) | constructive algorithms data structures greedy | Statement | F2 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 495 | Haystacks | constructive algorithms data structures greedy | Statement | E | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3000.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 353 | Stop Gaming (Hard Version) | brute force constructive algorithms data structures | Statement | E2 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 14926 | Kevin and Geometry | brute force constructive algorithms data structures geometry greedy implementation math two pointers | Statement | B | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 1129 | Infinite Sequence (Hard Version) | bitmasks constructive algorithms data structures dp implementation math | Statement | D2 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1250.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 517 | Skyscape | constructive algorithms data structures greedy | Statement | F | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 3000.0 | 141155 | |
| 1557 | Gleb and Boating | brute force constructive algorithms data structures dp graphs greedy math shortest paths | Statement | G | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 620 | Keep the Sum | constructive algorithms data structures | Statement | E | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 2750.0 | 142149 | |
| 12312 | Creating a Schedule | constructive algorithms data structures greedy sortings | Statement | D | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 2954 | Cheater | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 1750.0 | Codeforces Round #1031 Editorial | |
| 3989 | Ancient Tree | constructive algorithms data structures dfs and similar dsu greedy trees | Statement | E | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 816 | Submedians (Hard Version) | binary search constructive algorithms data structures two pointers | Statement | E2 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 14516 | Stay or Mirror | constructive algorithms data structures dp greedy | Statement | B | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 1000.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 2181 | Yet Another MEX Problem | brute force constructive algorithms data structures greedy | Statement | E | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 2500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 1433 | Git Gud | constructive algorithms data structures divide and conquer | Statement | F | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 2500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 7549 | Rae Taylor and Trees (hard version) | binary search constructive algorithms data structures dp dsu implementation trees | Statement | F | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 2566 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 711 | Simons and Reconstructing His Roads | constructive algorithms data structures dsu graphs meet-in-the-middle | Statement | F | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 2750.0 | Tutorial | |
| 216 | Star Map | constructive algorithms data structures geometry greedy | Statement | E | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 3000.0 | 152930 | |
| 2432 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 1273 | Covering Points with Circles | constructive algorithms data structures geometry probabilities | Statement | E | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 13628 | Palindromex | binary search brute force constructive algorithms data structures greedy implementation two pointers | Statement | D | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 1151 | Revival | binary search constructive algorithms data structures math two pointers | Statement | C | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1500.0 |