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 3Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 20109 | Training Before the Olympiad | constructive algorithms games implementation math | Statement | C | Good Bye 2023 {1916} | PROGRAMMING | 1250.0 | ||
| 28499 | 2023 | constructive algorithms implementation math number theory | Statement | A | Good Bye 2023 {1916} | PROGRAMMING | 250.0 | ||
| 32766 | Two Divisors | constructive algorithms math number theory | Statement | B | Good Bye 2023 {1916} | PROGRAMMING | 750.0 | ||
| 27443 | Least Product | constructive algorithms math | Statement | A | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 1675 | Construct Matrix | constructive algorithms math | Statement | E | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 32574 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 218 | Tree LGM | constructive algorithms games trees | Statement | G | Hello 2024 {1919} | PROGRAMMING | 4000.0 | 3500 | |
| 9269 | Increasing Subsequences | bitmasks constructive algorithms math | Statement | E | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 17323 | Klever Permutation | constructive algorithms math | Statement | E | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2253 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 24551 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
| 26885 | Sasha and the Drawing | constructive algorithms greedy math | Statement | B | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 17871 | Permutation Printing | brute force constructive algorithms math | Statement | B | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 3796 | One-Dimensional Puzzle | combinatorics constructive algorithms math number theory | Statement | G | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 8239 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 27478 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
| 8763 | Bitwise Operation Wizard | bitmasks constructive algorithms greedy interactive math | Statement | A | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 18588 | Farmer John's Challenge | constructive algorithms math | Statement | A | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 500.0 | CodeTON Round 8 Editorial | |
| 15679 | Bessie and MEX | constructive algorithms math | Statement | B | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 1000.0 | CodeTON Round 8 Editorial | |
| 482 | Make Triangle | constructive algorithms math | Statement | K | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 4592 | No Palindromes | brute force constructive algorithms greedy hashing implementation strings | Statement | E | Codeforces Global Round 25 {1951} | PROGRAMMING | 2250.0 | Codeforces Global Round 25 Editorial | |
| 6380 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
| 15350 | Nene's Magical Matrix | constructive algorithms greedy math | Statement | C | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 2474 | Folding Strip | constructive algorithms greedy strings | Statement | C | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 2300 |
| 22305 | Two Friends | constructive algorithms implementation math | Statement | A | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 800 | |
| 621 | Balanced Unshuffle (Medium) | brute force constructive algorithms trees | Statement | A2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 688 | Balanced Unshuffle (Hard) | constructive algorithms trees | Statement | A3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 9977 | Cat, Fox and Double Maximum | constructive algorithms greedy implementation math sortings | Statement | C | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #945 (Div. 2) | 1700 |
| 20110 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 18022 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 13249 | Permutation of Rows and Columns | constructive algorithms data structures hashing math matrices sortings | Statement | E | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 6441 | Turtle and an Incomplete Sequence | bitmasks constructive algorithms greedy implementation math | Statement | C | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1500.0 | Simplified Chinese Tutorial | |
| 2217 | Turtle and Multiplication | constructive algorithms dfs and similar graphs number theory | Statement | D | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2000.0 | Simplified Chinese Tutorial | |
| 11484 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 18606 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 28254 | Array Divisibility | constructive algorithms math | Statement | A | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 500.0 | ||
| 21226 | Large Addition | constructive algorithms implementation math | Statement | B | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 7992 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 758 | Grid Reset | constructive algorithms greedy | Statement | G | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 3000.0 | Video Tutorial | |
| 17960 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 50072 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 10972 | Novice's Mistake | brute force constructive algorithms math strings | Statement | E | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 33783 | Gorilla and Permutation | constructive algorithms math | Statement | C | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 1218 | Dyn-scripted Robot (Easy Version) | brute force chinese remainder theorem constructive algorithms math number theory | Statement | F1 | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 19841 | Fun Game | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 7714 | Funny Game | constructive algorithms dsu graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 10443 | 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 | |
| 26265 | Find K Distinct Points with Fixed Center | constructive algorithms implementation math | Statement | A | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 500.0 | Video Tutorial | |
| 28519 | Minimize Equal Sum Subarrays | constructive algorithms math number theory | Statement | B | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 750.0 | Video Tutorial | |
| 17979 | Black Circles | brute force constructive algorithms geometry greedy math | Statement | C | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 21444 | Distanced Coloring | constructive algorithms implementation math | Statement | A | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 500.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 26652 | Simple Palindrome | constructive algorithms greedy | Statement | A | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 750.0 | Discussion stream (With Hints) | |
| 42327 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 28654 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | 134298 | |
| 31494 | Zhan's Blender | constructive algorithms math | Statement | A | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 500.0 | 134298 | |
| 1400 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | 135341 | |
| 16879 | Concatenation of Arrays | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 500.0 | 135341 | |
| 1984 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 3597 | Common Generator | brute force constructive algorithms greedy math number theory | Statement | E | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2500.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 16009 | Penchick and BBQ Buns | brute force constructive algorithms math number theory | Statement | C | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 1500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 1428 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 21056 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 41681 | Sakurako and Kosuke | constructive algorithms math | Statement | A | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 2053 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 20926 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 | Codeforces Global Round 27 Editorial | |
| 25998 | Superultra's Favorite Permutation | constructive algorithms greedy math number theory | Statement | C | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 2415 | Shohag Loves Inversions | combinatorics constructive algorithms dp math | Statement | E | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2750.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 7154 | Shohag Loves GCD | constructive algorithms greedy math number theory | Statement | D | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 24518 | Paint a Strip | constructive algorithms greedy math | Statement | B | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 11029 | Ordered Permutations | constructive algorithms greedy math | Statement | C | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24553 | Harder Problem | constructive algorithms greedy math | Statement | D | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 236 | Cheops and a Contest (Easy Version) | constructive algorithms greedy | Statement | E1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 64 | Cactus without Bridges | constructive algorithms math | Statement | C | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 17564 | The Trail | constructive algorithms greedy math | Statement | C | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 19781 | Palindromic Subsequences | constructive algorithms math | Statement | C | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1500.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 14080 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 | ||
| 764 | Secret Message | constructive algorithms math | Statement | G | Hello 2025 {2057} | PROGRAMMING | 3750.0 | ||
| 12835 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 19115 | Cost of the Array | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1000.0 | 139094 | |
| 14942 | 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 | |
| 22491 | Kevin and Arithmetic | constructive algorithms greedy math | Statement | A | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 75 | Curse | constructive algorithms dp math | Statement | F | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 3000.0 | 139415 | |
| 25935 | Adjacent Digit Sums | constructive algorithms math | Statement | A | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 500.0 | ||
| 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 | |
| 21272 | Perfecto | brute force constructive algorithms greedy math probabilities | Statement | B | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1000.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 12637 | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | binary search constructive algorithms geometry greedy math | Statement | E | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 8678 | Goodbye, Banker Life | bitmasks combinatorics constructive algorithms math number theory | Statement | F | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 271 | AND x OR | bitmasks constructive algorithms dp | Statement | F | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 3733 | Finding OR Sum | bitmasks constructive algorithms implementation interactive math | Statement | B | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1000.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 14929 | Breach of Faith | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 18600 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 1228 | MST in Modulo Graph | constructive algorithms dsu graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 144 | Hot Matrix | constructive algorithms math | Statement | F | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 2500.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 9122 | Arcology On Permafrost | binary search brute force constructive algorithms greedy math | Statement | D | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1750.0 | 141155 | |
| 17561 | Max and Mod | constructive algorithms math | Statement | A | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 750.0 | 141155 | |
| 3208 | Serval and Modulo | brute force constructive algorithms math number theory | Statement | E | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 2500.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 1560 | 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 | ||
| 438 | Andryusha and CCB | brute force constructive algorithms greedy math number theory strings | Statement | F | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 3000.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 3903 | She knows... | combinatorics constructive algorithms graphs math | Statement | E | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 2250.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 23108 | Asuna and the Mosquitoes | constructive algorithms greedy math | Statement | C | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 1250.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 1049 | Bermuda Triangle | chinese remainder theorem constructive algorithms geometry math number theory | Statement | C | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 1500.0 | 142316 | |
| 21944 | Dinner Time | constructive algorithms math | Statement | A | Codeforces Round 1024 (Div. 2) {2102} | PROGRAMMING | 250.0 | 142788 | |
| 28888 | St. Chroma | constructive algorithms greedy math | Statement | B | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 12460 | Maximum Subarray Sum | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 1500.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 957 | Ain and Apple Tree | constructive algorithms greedy math trees | Statement | E | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 14884 | SUMdamental Decomposition | bitmasks constructive algorithms greedy implementation math | Statement | B | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1250.0 | Codeforces Round 1022 Editorial | |
| 11760 | Hacking Numbers (Easy Version) | bitmasks constructive algorithms interactive math number theory | Statement | C1 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 1250.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 8911 | Hacking Numbers (Medium Version) | constructive algorithms interactive math number theory | Statement | C2 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 750.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 3326 | Hacking Numbers (Hard Version) | constructive algorithms interactive math number theory | Statement | C3 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 500.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 1455 | Puzzle | brute force constructive algorithms greedy math | Statement | F | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 992 | Two Arrays | constructive algorithms dfs and similar graphs math | Statement | F | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 3000.0 | Codeforces Round #1031 Editorial | |
| 16458 | Gellyfish and Flaming Peony | brute force constructive algorithms dp greedy math number theory shortest paths | Statement | A | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 29436 | Equal Subsequences | constructive algorithms greedy | Statement | A | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 16798 | A Good Problem | bitmasks constructive algorithms math | Statement | C | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 12991 | Divine Tree | constructive algorithms greedy math sortings trees | Statement | C | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1250.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 9661 | Manhattan Pairs | constructive algorithms greedy math sortings | Statement | C | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 4876 | Make it Zero | constructive algorithms math | Statement | E | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 355 | Lexicographic Partition | constructive algorithms math trees | Statement | I | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 126 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 21116 | Mix Mex Max | constructive algorithms greedy math | Statement | A | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 1899 | Interactive RBS (Hard Version) | binary search bitmasks constructive algorithms dp interactive | Statement | C3 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 4504 | Interactive RBS (Easy Version) | binary search bitmasks constructive algorithms interactive | Statement | C1 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 3162 | Interactive RBS (Medium Version) | binary search bitmasks constructive algorithms interactive | Statement | C2 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 909 | Sea, You & copriMe | brute force combinatorics constructive algorithms graphs greedy math number theory | Statement | H | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 31497 | Alternating Series | constructive algorithms greedy math | Statement | B | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 27401 | Painting With Two Colors | constructive algorithms implementation math | Statement | A | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 500.0 | 145832 | |
| 21895 | Add 0 or K | constructive algorithms math number theory | Statement | B | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 1250.0 | 145832 | |
| 1188 | From the Unknown (Hard Version) | binary search brute force constructive algorithms interactive math | Statement | D2 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1250.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 8558 | For the Champion | constructive algorithms interactive math | Statement | B | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 3375 | From the Unknown (Easy Version) | constructive algorithms interactive math | Statement | D1 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1250.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 21689 | Like the Bitset | constructive algorithms greedy two pointers | Statement | B | Codeforces Round 1046 (Div. 2) {2136} | PROGRAMMING | 1000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 36309 | Collatz Conjecture | constructive algorithms math | Statement | A | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 27364 | Fun Permutation | constructive algorithms math number theory | Statement | B | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 23200 | Another Divisibility Problem | constructive algorithms math number theory | Statement | B | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1000.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 2116 | Make Good | constructive algorithms math strings | Statement | E | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 2500.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 7029 | Inversion Value of a Permutation | constructive algorithms dfs and similar dp math | Statement | D | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 3895 | Monotone Subsequence | brute force constructive algorithms dp graphs interactive math | Statement | E | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 3000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 5532 | Find the Last Number | bitmasks constructive algorithms interactive math | Statement | D | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 2000.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 669 | Isaac's Queries | brute force constructive algorithms dfs and similar divide and conquer greedy interactive math probabilities | Statement | G | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 10848 | Meximum Array 2 | constructive algorithms greedy math | Statement | C | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 3430 | Palindrome Flipping | brute force constructive algorithms implementation strings | Statement | D | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2000.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 287 | Distinct GCDs (Hard Version) | combinatorics constructive algorithms graphs graphs graphs math number theory number theory | Statement | F2 | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1000.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 14697 | Split | constructive algorithms greedy math | Statement | B | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1250.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 2898 | Beautiful Tree | constructive algorithms math trees | Statement | G | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 9480 | Siga ta Kymata | constructive algorithms math | Statement | B | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1000.0 | Codeforces Round 1063 Editorial | |
| 2372 | Removal of a Sequence (Hard Version) | binary search constructive algorithms divide and conquer greedy implementation math number theory probabilities | Statement | D2 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 14120 | Blackslex and Penguin Civilization | bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6028 | Blackslex and Girls | constructive algorithms geometry math | Statement | E | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6714 | XOR-factorization | bitmasks constructive algorithms dp greedy number theory | Statement | C | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1500.0 | Codeforces Global Round 31 | |
| 45626 | Perfect Root | constructive algorithms math | Statement | A | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 14675 | XOR Convenience (Easy Version) | bitmasks brute force constructive algorithms math | Statement | C1 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 1250.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 6494 | XOR-convenience (Hard Version) | bitmasks brute force constructive algorithms math | Statement | C2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 5186 | Sum of Digits (and Again) | brute force constructive algorithms math | Statement | E | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 21894 | Bingo Candies | constructive algorithms math | Statement | A | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 500.0 | Tutorial | |
| 368 | Binary Strings are Simple? | constructive algorithms dsu interactive number theory | Statement | E | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 2750.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 3709 | Interval Mod | constructive algorithms dp greedy math | Statement | A | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 750.0 | 152930 | |
| 30757 | The 67th Permutation Problem | constructive algorithms greedy math | Statement | C | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 3763 | Unique Values (Hard version) | binary search constructive algorithms divide and conquer interactive math | Statement | B2 | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 500.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 154 | Weird Chessboard | constructive algorithms math | Statement | E | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 3000.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 7757 | Zhily and Bracket Swapping | constructive algorithms greedy | Statement | A | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 8941 | Zhily and Mex and Max | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026) {2224} | PROGRAMMING | 750.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 22699 | Snowfall | constructive algorithms math | Statement | C | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 787 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 8574 | XOR, Expression and Two Binary Numbers | bitmasks constructive algorithms math number theory | Statement | D | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | ||
| 21778 | Palindrome, Twelve and Two Terms | constructive algorithms math | Statement | B | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 750.0 | ||
| 12424 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 6153 | Fullmetal Bitchemist | constructive algorithms greedy math | Statement | D | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1750.0 | ||
| 1239 | Revival | binary search constructive algorithms data structures math two pointers | Statement | C | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1500.0 | ||
| 8668 | Nim Game Is XOR Game | bitmasks constructive algorithms games greedy math | Statement | A | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 750.0 | ||
| 19613 | Good times Good times | constructive algorithms math | Statement | B | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | |||
| 1353 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | |||
| 11349 | Yaroslav and Productivity | constructive algorithms dp greedy math number theory | Statement | D | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | |||
| 15520 | Stepan and Permutation | constructive algorithms dsu greedy math number theory sortings | Statement | C | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | |||
| 5960 | MEXOR | bitmasks constructive algorithms math | Statement | C | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 1250.0 | ||
| 612 | Xor Permutation Matrix | bitmasks chinese remainder theorem constructive algorithms math | Statement | D | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 2250.0 |