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 ... 5 6 7Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3075 | Ardent Flames | binary search data structures sortings two pointers | Statement | F | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 15231 | Sharky Surfing | data structures greedy two pointers | Statement | D | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 925 | Divide OR Conquer | bitmasks data structures dp implementation | Statement | D | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2400 | ||
| 501 | Alternative Platforms | combinatorics data structures fft math sortings | Statement | F | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 | ||
| 766 | Polyathlon | data structures hashing string suffix structures strings | Statement | I | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 | ||
| 160 | Barrels | data structures greedy math | Statement | E | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2900 | ||
| 710 | Auto Complete | data structures implementation sortings strings trees | Statement | I | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 5629 | Recommendations | binary search data structures implementation sortings | Statement | D | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 957 | Two Subarrays | data structures dp implementation matrices | Statement | F | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 11665 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 2754 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 11418 | Move Back at a Cost | binary search data structures greedy sortings | Statement | B | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 750.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 2467 | Adventurers | binary search data structures sortings | Statement | C | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 1500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 146 | 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) | |
| 112 | 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) | |
| 8635 | Kevin and Competition Memories | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Global Round 28 {2048} | PROGRAMMING | 1250.0 | Tutorial | |
| 1373 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | Tutorial | |
| 279 | Kevin and Strange Operation | data structures dp | Statement | H | Codeforces Global Round 28 {2048} | PROGRAMMING | 2750.0 | Tutorial | |
| 613 | MEX OR Mania | bitmasks data structures implementation | Statement | F | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 11806 | Maximum modulo equality | data structures math number theory | Statement | F | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 12511 | Best Price | brute force data structures greedy sortings | Statement | E | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 7880 | Refined Product Optimality | binary search data structures greedy implementation math schedules sortings | Statement | D | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1750.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 111 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 982 | Earnest Matrix Complement | data structures dp greedy implementation | Statement | F | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 517 | Haystacks | constructive algorithms data structures greedy | Statement | E | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3000.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 3774 | Unique Median | brute force data structures divide and conquer | Statement | D | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2000.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 192 | Coffee Break | data structures greedy greedy math | Statement | H | Hello 2025 {2057} | PROGRAMMING | 4500.0 | ||
| 5610 | Gifts Order | data structures greedy math | Statement | D | Hello 2025 {2057} | PROGRAMMING | 2250.0 | ||
| 6842 | Graph and Graph | data structures graphs greedy shortest paths | Statement | D | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 2000.0 | 139094 | |
| 2340 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 15101 | 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 | |
| 11218 | Kevin and Numbers | brute force data structures greedy implementation math | Statement | D | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 10451 | Kevin and Puzzle | data structures dp | Statement | C | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 159 | Kevin and Binary String (Hard Version) | data structures dp | Statement | F2 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 478 | The Game (Hard Version) | data structures dfs and similar games graphs trees | Statement | E2 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 2500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 5239 | Game With Triangles | binary search data structures dp greedy math ternary search two pointers | Statement | D | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2250.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 15522 | Remove Exactly Two | brute force data structures dp graphs greedy sortings trees | Statement | C | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 1602 | Counting Is Not Fun (Easy Version) | combinatorics data structures dfs and similar dsu implementation math | Statement | F1 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 984 | Counting Is Not Fun (Hard Version) | combinatorics data structures dfs and similar dsu trees | Statement | F2 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 2466 | Triangle Tree | data structures dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 6082 | Eating | binary search bitmasks data structures greedy two pointers | Statement | D | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1750.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 750 | We Be Summing | binary search data structures two pointers | Statement | F | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 2750.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 1551 | Mycraft Sand Sort | combinatorics data structures dsu | Statement | E | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 2250.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 2077 | Bro Thinks He's Him | combinatorics data structures dp matrices | Statement | H | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 7500 | Skibidus and Slay | data structures dfs and similar graphs greedy trees | Statement | F | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 472 | Tropical Season | data structures greedy implementation | Statement | E | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 2000.0 | 139415 | |
| 392 | Porto Vs. Benfica | data structures dfs and similar dsu graphs shortest paths | Statement | E | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 835 | Graph Inclusion | data structures divide and conquer dsu | Statement | F | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 1969 | Game with Binary String | data structures divide and conquer games greedy math | Statement | E | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 1144 | 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 | |
| 14990 | Two Colors | binary search data structures dp math | Statement | C | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 546 | Beautiful Sequence Returns | binary search data structures implementation | Statement | F | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 397 | Maximum Polygon | brute force data structures implementation math | Statement | D | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 647 | Another Folding Strip | combinatorics data structures divide and conquer dp math sortings | Statement | E | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 47 | Alice, Bob, And Two Arrays | *special data structures dp games | Statement | A | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 186 | Arithmetic Exercise | *special data structures dp greedy | Statement | B | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 528 | Skyscape | constructive algorithms data structures greedy | Statement | F | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 3000.0 | 141155 | |
| 123 | Wish Upon a Satellite (Hard Version) | data structures dp | Statement | G2 | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1750.0 | 141155 | |
| 5623 | Serval and Kaitenzushi Buffet | data structures graph matchings greedy | Statement | D | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1750.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 828 | Serval and Colorful Array (Easy Version) | data structures greedy | Statement | F1 | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 2000.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 562 | Serval and Colorful Array (Hard Version) | data structures greedy | Statement | F2 | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1000.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 3367 | Canteen (Easy Version) | binary search data structures flows greedy two pointers | Statement | B1 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 1000.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 1361 | Canteen (Hard Version) | binary search data structures greedy math two pointers | Statement | B2 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 500.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 1672 | 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 | ||
| 4111 | Shorten the Array | binary search brute force data structures dfs and similar greedy strings trees two pointers | Statement | G | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 8303 | Chimpanzini Bananini | data structures math | Statement | G | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 558 | Wonderful Impostors | data structures implementation two pointers | Statement | F | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 2750.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 5092 | 23 Kingdom | binary search data structures greedy ternary search two pointers | Statement | C | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 2000.0 | 142788 | |
| 3299 | Kia Bakes a Cake | data structures dp graphs greedy | Statement | E | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 3250.0 | 142788 | |
| 9179 | Quartet Swapping | data structures greedy sortings | Statement | B | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 1250.0 | 142788 | |
| 2330 | Mani and Segments | data structures implementation two pointers | Statement | D | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 2500.0 | 142788 | |
| 656 | Maximize Nor | bitmasks data structures implementation | Statement | F | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 3000.0 | 142149 | |
| 8472 | Unpleasant Strings | binary search data structures dp greedy strings | Statement | E | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 21557 | Move to the End | brute force data structures dp greedy | Statement | B | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 572 | Modulo 3 | data structures divide and conquer dsu trees | Statement | G | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 587 | Cycling (Hard Version) | binary search data structures dp geometry greedy | Statement | F2 | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2500.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 15417 | Neo's Escape | data structures dsu graphs greedy implementation | Statement | C | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1500.0 | Codeforces Round 1022 Editorial | |
| 5578 | Changing the String | binary search data structures greedy implementation sortings strings | Statement | E | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 439 | Divisible Subarrays | brute force data structures interactive | Statement | G | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 12530 | 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 | ||
| 3002 | Cheater | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 1750.0 | Codeforces Round #1031 Editorial | |
| 1039 | Incessant Rain | data structures divide and conquer | Statement | H | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 21991 | Cool Partition | data structures greedy | Statement | C | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 2348 | Ice Baby | binary search brute force data structures dp implementation sortings | Statement | H | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 8489 | Yamakasi | binary search brute force data structures greedy | Statement | F | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 5584 | Gangsta | data structures divide and conquer math sortings | Statement | G | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 15594 | MEX Count | binary search data structures greedy sortings two pointers | Statement | E | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 3481 | Modular Sorting | brute force data structures math number theory | Statement | G | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 1261 | Big Wins! (hard version) | binary search data structures divide and conquer two pointers | Statement | G2 | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 4513 | 1-1-1, Free Tree! | data structures dfs and similar graphs trees | Statement | F | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 2818 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 5466 | 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 | |
| 839 | 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 | |
| 6951 | Submedians (Easy Version) | binary search data structures dp greedy | Statement | E1 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 16255 | 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 | |
| 720 | Induced Subgraph Queries | data structures graphs sortings | Statement | E | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 3000.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 4883 | Unjust Binary Life | binary search binary search data structures greedy greedy math two pointers | Statement | F | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 8681 | Arithmetics Competition | binary search data structures greedy ternary search | Statement | E | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 529 | Flint and Steel | data structures dp | Statement | F | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 3250.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 21563 | Against the Difference | data structures dp | Statement | A | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 500.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 701 | To the Infinity | data structures hashing math trees | Statement | F | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 4000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 4269 | Prefix Maximum Invariance | binary search data structures sortings | Statement | F | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 5721 | Antiamuny Wants to Learn Swap | data structures greedy | Statement | B | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1250.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 13374 | Ultimate Value | data structures games greedy | Statement | C | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1250.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 66 | Good Robot Paths | *special data structures geometry sortings | Statement | G | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 6952 | Inversion Graph Coloring (Easy Version) | binary search data structures dp two pointers | Statement | D1 | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1750.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 3079 | Inversion Graph Coloring (Hard Version) | binary search data structures dp two pointers | Statement | D2 | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 476 | Increasing Xor | data structures math | Statement | F | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 3000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 1621 | Looking at Towers (difficult version) | combinatorics data structures dp implementation | Statement | E2 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 3305 | Predicting Popularity | binary search data structures math sortings | Statement | E | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 2224 | 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 | |
| 2386 | Maximum OR Popcount | binary search bitmasks brute force data structures greedy | Statement | E | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2500.0 | ||
| 1746 | Exchange Queries | data structures greedy | Statement | F | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 3000.0 | ||
| 4470 | Farmer John's Last Wish | data structures math number theory | Statement | G | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 2917 | Buratsuta 3 | binary search brute force data structures divide and conquer probabilities | Statement | G | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 9986 | Hidden Knowledge of the Ancients | data structures two pointers | Statement | E | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 4767 | Limited Edition Shop | data structures dp | Statement | C | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 14477 | Incremental Path | data structures implementation | Statement | A | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 9095 | Division Versus Addition | bitmasks data structures games | Statement | D | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 2500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 4062 | Triple Attack | brute force data structures greedy trees two pointers | Statement | F | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 272 | Victorious Coloring (Hard Version) | data structures data structures data structures data structures | Statement | H2 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 2500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 4081 | Query Jungle | data structures data structures implementation math math trees | Statement | G | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 15086 | Triple Removal | data structures greedy math | Statement | C | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 1500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 347 | Odd Queries on Odd Array | data structures trees | Statement | F | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 3250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 762 | Juan's Colorful Tree | data structures data structures dfs and similar dfs and similar dsu graphs graphs trees | Statement | F | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 3000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 1023 | Best Time to Buy and Sell Stock | binary search data structures games greedy | Statement | E | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 2750.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 1712 | Strange Operation (Easy Version) | brute force data structures greedy implementation | Statement | F1 | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 3250.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 290 | Strange Operation (Hard Version) | data structures greedy | Statement | F2 | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 3250.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 5723 | Adjusting Drones | binary search data structures dsu greedy implementation sortings | Statement | E | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 2000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 1898 | 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 | |
| 696 | Sink | data structures dsu dsu graphs graphs | Statement | E | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2750.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 2422 | Inverse Minimum Partition (Easy Version) | binary search data structures dp greedy math two pointers | Statement | D1 | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 4308 | Rectangles | data structures dsu implementation two pointers | Statement | B | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 2966 | Locked Out | binary search data structures dp graphs greedy implementation two pointers | Statement | D | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 2250.0 | ||
| 13562 | Dungeon | binary search brute force data structures greedy sortings | Statement | C | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1500.0 | Codeforces Global Round 30 Editorial | |
| 943 | Chain Prefix Rank (Hard Version) | combinatorics data structures dp math | Statement | F2 | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1500.0 | Codeforces Global Round 30 Editorial | |
| 118 | PalindromePalindrome | data structures strings | Statement | H | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 5500.0 | Codeforces Global Round 30 Editorial | |
| 9888 | khba Loves to Sleep! | binary search data structures geometry implementation math | Statement | E | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 11817 | Mukhammadali and the Smooth Array | data structures dp | Statement | G | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 7924 | Tree, TREE!!! | data structures dp trees | Statement | F | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 7901 | 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 | ||
| 1104 | Shiori Miyagi and Maximum Array Score | binary search data structures dp | Statement | H | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 12725 | Rae Taylor and Trees (easy version) | binary search data structures dp dsu greedy implementation trees | Statement | D | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 652 | Isla's Memory Thresholds | binary search data structures divide and conquer math | Statement | F | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 3000.0 | ||
| 337 | Secret Message | data structures greedy trees | Statement | D | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 2750.0 | Codeforces Round 1069 Editorial | |
| 1396 | Remove at the lowest cost | data structures dfs and similar greedy implementation trees | Statement | E | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 6296 | Fibonacci Paths | data structures dp geometry graphs sortings | Statement | D | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2000.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 30264 | Operations with Inversions | data structures greedy implementation | Statement | A | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 657 | deCH OR Dations | data structures hashing | Statement | G | Good Bye 2025 {2178} | PROGRAMMING | 3500.0 | ||
| 1404 | Blackslex and Plants | bitmasks data structures dp math | Statement | H | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 1512 | Doorway | binary search data structures sortings | Statement | D | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 6751 | Battle of Arrays | brute force data structures games greedy | Statement | B | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 404 | Short Garland | data structures dp trees | Statement | G | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 6063 | New Year's Gifts | data structures greedy implementation sortings two pointers | Statement | E | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 1299 | Jumping Man | combinatorics data structures dp trees | Statement | F | Hello 2026 {2183} | PROGRAMMING | 2750.0 | ||
| 2643 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 3314 | Nastiness of Segments | binary search data structures divide and conquer | Statement | G | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 6459 | Exquisite Array | combinatorics data structures dsu | Statement | E | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 799 | BattleCows 2 | binary search brute force data structures greedy | Statement | H | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 5711 | BattleCows | data structures divide and conquer implementation | Statement | F | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 3833 | Mixing MEXes | data structures implementation math | Statement | G | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 22535 | OutOfMemoryError | data structures implementation math two pointers | Statement | D | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 282 | Al Fine (Maximizing Version) | binary search data structures divide and conquer greedy trees | Statement | F1 | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 1528 | Jerry and Tom | data structures dfs and similar games graphs greedy trees | Statement | C | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 1750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 403 | Doors and Keys | data structures dp | Statement | E | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2250.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 4129 | Cost of Tree | data structures dfs and similar dp trees | Statement | D | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1750.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 240 | Again Trees... (hard version) | bitmasks data structures dfs and similar dp fft trees | Statement | F2 | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 1245 | Idiot First Search and Queries | binary search data structures graphs trees | Statement | G | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 328 | Fuzzy Concatenation (Easy Version) | binary search bitmasks brute force data structures greedy string suffix structures | Statement | E1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2000.0 | Tutorial | |
| 254 | Fuzzy Concatenation (Hard version) | binary search data structures dp greedy string suffix structures | Statement | E2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 1000.0 | Tutorial | |
| 1113 | Double Bracket Sequence | data structures dp greedy sortings | Statement | D | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2250.0 | Tutorial | |
| 120 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 3442 | Mooclear Reactor 2 | data structures greedy implementation sortings | Statement | F | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 5732 | Lost Civilization (Hard Version) | data structures dp | Statement | A2 | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 500.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 893 | Binary Not Search and Queries | data structures greedy implementation | Statement | D | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 2250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 1578 | Probabilistic Card Game | binary search data structures math ternary search | Statement | E | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 247 | Simons and Diophantus Equation | bitmasks brute force data structures number theory | Statement | G | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 3250.0 | Tutorial | |
| 754 | 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 | |
| 5885 | Simons and Beating Peaks | data structures divide and conquer dp greedy implementation trees | Statement | D | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1750.0 | Tutorial | |
| 364 | Christmas Tree Un-decoration | data structures dp trees | Statement | D | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 6689 | Where's My Water? | data structures divide and conquer implementation | Statement | C | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1500.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 342 | Hanabi | data structures dp flows graph matchings graphs greedy | Statement | F | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 2183 | Tree Orientation (Hard Version) | data structures dfs and similar dsu graphs greedy matrices sortings trees | Statement | D2 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 484 | Dynamic Values And Maximum Sum | data structures greedy implementation trees | Statement | F | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 3000.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 242 | 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 | |
| 2581 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 4075 | Zhily and Barknights | binary search data structures dp math sortings two pointers | Statement | B | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 750.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 77 | Zhily and Permutation | data structures divide and conquer trees | Statement | E | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 3500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 1353 | Covering Points with Circles | constructive algorithms data structures geometry probabilities | Statement | E | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 8582 | Mental Monumental (Easy Version) | binary search data structures greedy math two pointers | Statement | C | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 1500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 1109 | Mental Monumental (Hard Version) | data structures greedy math | Statement | E | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 15039 | 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 | ||
| 10435 | It All Went Sideways | binary search data structures dp greedy | Statement | E | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 2381 | Drowning | binary search data structures math | Statement | G | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 4729 | It Just Keeps Going Sideways | data structures dp greedy math | Statement | F | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 385 | Amanojaku and Sequence (Hard Version) | combinatorics data structures implementation math | Statement | E2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 3045 | Sanae, Cross and Color | data structures implementation | Statement | D | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 2108 | Deconstruction Tree | combinatorics data structures dp graphs trees | Statement | E | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 2500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 384 | Roadworks | data structures dp | Statement | G | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 3250.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 1577 | Minimum Influence | binary search data structures geometry greedy implementation math sortings two pointers | Statement | E | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 3730 | Goods on the Shelf | brute force data structures two pointers | Statement | D | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 2215 | Vlad, Misha and Two Arrays | combinatorics data structures dfs and similar divide and conquer dp | Statement | E | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 2500.0 | Tutorial | |
| 2474 | Vessels, Heights and Two Versions (Hard Version) | data structures dfs and similar dsu greedy implementation trees | Statement | F | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | Tutorial | |
| 409 | Stripe, Token and Two Players | data structures games | Statement | G | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 3250.0 | Tutorial | |
| 449 | Criterion in Burlandia | brute force data structures implementation | Statement | G | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 1164 | Paint the Array | data structures dp greedy | Statement | F | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 158 | Slime and Queries | data structures greedy trees | Statement | H | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 3500.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 1560 | Revival | binary search constructive algorithms data structures math two pointers | Statement | C | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1500.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 1039 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 5244 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 11963 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 497 | Summer Vacation | data structures dp probabilities | Statement | F | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 18108 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 3098 | Yura and Deadlines | data structures dp | Statement | G | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 9384 | Masha and the Garland | data structures dp strings | Statement | E | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 2580 | XOR Sorting (Hard Version) | bitmasks data structures greedy | Statement | D2 | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 1250.0 | ||
| 614 | Paths on a Grid | data structures dp hashing | Statement | F | Codeforces Round 1111 (Div. 2) {2247} | PROGRAMMING | 3500.0 | ||
| 1849 | Double-Rift Dial | data structures dfs and similar dsu implementation two pointers | Statement | C | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 1750.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 10354 | Risky Tower | binary search brute force data structures greedy sortings | Statement | C | Codeforces Round 1115 (Div. 2) {2252} | PROGRAMMING | 1250.0 | 155741 | |
| 12650 | Hypercarp and the Control Panel | brute force data structures two pointers | Statement | B | Educational Codeforces Round 193 (Rated for Div. 2) {2253} | PROGRAMMING | 155813 | ||
| 8345 | Chronostasis | binary search data structures greedy | Statement | E | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 1298 | Nightcrawler | data structures dfs and similar dp greedy sortings trees | Statement | G | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 698 | Beaver's Jumping Track (Easy Version) | data structures dp matrices | Statement | F1 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 2750.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 412 | Beaver's Jumping Track (Hard Version) | data structures dp matrices | Statement | F2 | Codeforces Round 1117 (Div. 2) {2257} | PROGRAMMING | 1000.0 | Codeforces Round 1117 (Div. 2) Editorial | |
| 853 | DivMEX | data structures math number theory | Statement | E | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 2250.0 | Codeforces Round 1118 (Div. 2) Editorial | |
| 2613 | Index Removal | binary search data structures math | Statement | G | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 3507 | Binary Bubble Sort Inversions | data structures math two pointers | Statement | F | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | Codeforces Round 1119 (Div. 3) Editorial | ||
| 1956 | Culling Game | binary search data structures two pointers | Statement | B | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 1750.0 | Codeforces Round 1120 (Div 1, Div 2) Editorial | |
| 11121 | Knife's Pill Farm | data structures greedy | Statement | B | Codeforces Round 1121 (Div. 2) {2264} | PROGRAMMING | 1250.0 | Codeforces Round 1121 (Div. 2) Editorial | |
| 8372 | Falling Concrete | constructive algorithms data structures math sortings | Statement | D | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 358 | Deque Malfunction | data structures dp greedy | Statement | H | Codeforces Round 1122 (Div. 3) {2266} | PROGRAMMING | Codeforces Round 1122 (Div. 3) Editorial | ||
| 775 | XOR Transformations (Hard Version) | bitmasks brute force data structures greedy strings trees | Statement | F2 | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 2000.0 | 157126 | |
| 1702 | Clean Substrings | combinatorics data structures math | Statement | E | Codeforces Round 1123 (Div. 2) {2267} | PROGRAMMING | 1750.0 | 157126 | |
| 932 | KiaKio and Energy Intervals | binary search bitmasks brute force data structures divide and conquer greedy two pointers | Statement | C | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 1750.0 | 157140 | |
| 556 | AghaBalaSar and Hamed | data structures dp trees | Statement | D | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 2250.0 | 157140 | |
| 307 | Kia Kio and Tree of Life | data structures fft math trees | Statement | E | Codeforces Round 1124 (Div. 1) {2268} | PROGRAMMING | 2750.0 | 157140 |