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 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3055 | Chain Reaction | data structures dsu greedy implementation math number theory | Statement | E | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 2308 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 2644 | Division + LCP (hard version) | binary search brute force data structures dp hashing math string suffix structures strings | Statement | G2 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 2200 | |
| 5812 | Shop Game | data structures greedy math sortings | Statement | D | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1900 | |
| 11782 | XOUR | data structures dsu sortings | Statement | G | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1400 | |
| 17113 | Cat, Fox and the Lonely Array | binary search bitmasks data structures greedy math two pointers | Statement | B | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #945 (Div. 2) | 1300 |
| 2956 | Chain Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2000.0 | editorial_zh.pdf | 2100 |
| 1344 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 8185 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 13901 | Elections | data structures greedy implementation math | Statement | D | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1500.0 | 130527 | |
| 13284 | Permutation of Rows and Columns | constructive algorithms data structures hashing math matrices sortings | Statement | E | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 4453 | Field Division (easy version) | data structures geometry math sortings | Statement | F1 | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 10183 | Beauty of the mountains | brute force data structures implementation math number theory | Statement | D | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1750.0 | 130839 | |
| 1508 | Permutation Problem (Hard Version) | brute force data structures hashing math number theory | Statement | G2 | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 10306 | Bouquet (Hard Version) | binary search data structures greedy math sortings two pointers | Statement | B2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 10458 | 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 | |
| 2317 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 16662 | Photoshoot for Gorillas | combinatorics data structures greedy math | Statement | E | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 1438 | Make a Palindrome | brute force data structures dp greedy math | Statement | F | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 4448 | Iris and the Tree | brute force data structures dfs and similar dsu math trees | Statement | B | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 1250.0 | Tutorial | |
| 8687 | Firefly's Queries | data structures math | Statement | F | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 680 | Game in Tree (Easy Version) | binary search data structures games implementation trees | Statement | F1 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 7649 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 246 | Complex Segments (Easy Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 210 | Complex Segments (Hard Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 17605 | All Pairs Segments | data structures implementation math | Statement | B | Codeforces Round 975 (Div. 2) {2019} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 1966 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1255 | Digital Village (Hard Version) | data structures dp dsu graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 727 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | 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 | |
| 977 | Boss, Thirsty | data structures dp greedy math | Statement | D | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 2500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 21796 | Meaning Mean | data structures greedy math sortings | Statement | A | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 137 | Hills and Pits | data structures data structures math math | Statement | F | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 3000.0 | 135341 | |
| 8068 | Attribute Checks | brute force data structures dp implementation math | Statement | D | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 6118 | Sums of Segments | binary search data structures dp implementation math | Statement | D | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 2009 | MEXimize the Score | brute force combinatorics data structures dp math | Statement | E | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2000.0 | Codeforces Round 979 Editorial | |
| 1429 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 14777 | Sakurako, Kosuke, and the Permutation | brute force data structures dfs and similar dsu fft greedy math | Statement | E | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 5922 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | Codeforces Global Round 27 Editorial | |
| 495 | 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 | ||
| 158 | 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 | ||
| 11513 | 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 | ||
| 2681 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 1349 | 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 | |
| 11358 | Maximum modulo equality | data structures math number theory | Statement | F | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 7834 | 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 | |
| 110 | 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 | |
| 189 | Coffee Break | data structures greedy greedy math | Statement | H | Hello 2025 {2057} | PROGRAMMING | 4500.0 | ||
| 5552 | Gifts Order | data structures greedy math | Statement | D | Hello 2025 {2057} | PROGRAMMING | 2250.0 | ||
| 2309 | 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 | |
| 14972 | 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 | |
| 11076 | 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 | |
| 154 | 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 | |
| 5176 | 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 | |
| 1580 | 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 | |
| 952 | 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 | |
| 1911 | 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 | ||
| 1132 | 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 | |
| 14806 | 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 | ||
| 393 | 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 | |
| 632 | 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 | |
| 1340 | 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 | |
| 1631 | 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 | ||
| 8138 | Chimpanzini Bananini | data structures math | Statement | G | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 2823 | Kia Bakes a Cake | data structures dp graphs greedy | Statement | E | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 3250.0 | 142788 | |
| 5502 | Gangsta | data structures divide and conquer math sortings | Statement | G | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 15359 | 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 | ||
| 3424 | Modular Sorting | brute force data structures math number theory | Statement | G | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 4826 | 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 | ||
| 489 | Flint and Steel | data structures dp | Statement | F | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 3250.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 518 | 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 | |
| 457 | Increasing Xor | data structures math | Statement | F | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 3000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 3254 | 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 | ||
| 4354 | 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 | ||
| 3491 | 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 | |
| 14354 | 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 | |
| 337 | 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 | |
| 2048 | 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 | |
| 758 | 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 | |
| 9596 | khba Loves to Sleep! | binary search data structures geometry implementation math | Statement | E | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 629 | Isla's Memory Thresholds | binary search data structures divide and conquer math | Statement | F | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 3000.0 | ||
| 1362 | Blackslex and Plants | bitmasks data structures dp math | Statement | H | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 3681 | Mixing MEXes | data structures implementation math | Statement | G | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 21966 | OutOfMemoryError | data structures implementation math two pointers | Statement | D | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 311 | 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 | |
| 239 | 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 | |
| 1073 | Double Bracket Sequence | data structures dp greedy sortings | Statement | D | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2250.0 | Tutorial | |
| 101 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 1525 | 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 | ||
| 3736 | 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 | |
| 8177 | 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 | |
| 1053 | 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 | |
| 2238 | Drowning | binary search data structures math | Statement | G | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 4461 | 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 | ||
| 314 | 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 | |
| 1480 | 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 | ||
| 136 | 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 | |
| 1288 | 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 | |
| 884 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 4644 | A Bit Odd | data structures games greedy math | Statement | F | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 10897 | Unstable Elements | brute force data structures implementation sortings two pointers | Statement | C | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 16852 | Predominant Frequency Division | data structures greedy implementation math | Statement | B | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 |