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 |
|---|---|---|---|---|---|---|---|---|---|
| 6077 | Plinko | *special games interactive | Statement | B | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 466 | Wonderful Guessing Game | interactive | Statement | G | 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 | |
| 668 | Baudelaire (hard version) | binary search dfs and similar divide and conquer implementation interactive trees | Statement | G2 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 1701 | Baudelaire (easy version) | binary search interactive trees | Statement | G1 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 2495 | Needle in a Numstack | binary search brute force interactive math | Statement | D | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2250.0 | Codeforces Round 1022 Editorial | |
| 11975 | 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 | |
| 9062 | 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 | |
| 3471 | 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 | |
| 438 | Divisible Subarrays | brute force data structures interactive | Statement | G | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 172 | 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 | |
| 195 | Inter Active (Easy Version) | binary search constructive algorithms interactive interactive | Statement | G1 | 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 | |
| 2325 | 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 | |
| 5313 | 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 | |
| 3912 | 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 | |
| 1028 | Top-K Tracker (Easy Version) | interactive | Statement | F1 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 2500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 143 | Top-K Tracker (Hard Version) | interactive interactive | Statement | F2 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 2500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 13497 | The Nether | graphs interactive | Statement | C | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 1750.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 2554 | Power Boxes | constructive algorithms dp interactive | Statement | E | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 2250.0 | 145832 | |
| 1495 | 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 | |
| 9479 | 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 | |
| 4329 | 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 | |
| 893 | Hidden Single (Version 2) | divide and conquer interactive math probabilities | Statement | E2 | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 2921 | Hidden Single (Version 1) | divide and conquer interactive math probabilities sortings | Statement | E1 | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 4809 | 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 | |
| 6332 | Batteries | interactive math | Statement | D | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 2000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 5626 | 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 | |
| 991 | 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 | |
| 904 | Grand Finale: Snakes | binary search interactive | Statement | F | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 3500.0 | Codeforces Round 1058 Editorial | |
| 9691 | MAD Interactive Problem | constructive algorithms implementation interactive | Statement | A | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 750.0 | Codeforces Round 1058 Editorial | |
| 13082 | Beautiful Permutation | binary search interactive | Statement | D | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 2872 | Diadrash (Easy Version) | binary search divide and conquer interactive | Statement | D1 | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1500.0 | Codeforces Round 1063 Editorial | |
| 1608 | Diadrash (Hard Version) | binary search interactive | Statement | D2 | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1250.0 | Codeforces Round 1063 Editorial | |
| 695 | Plegma | interactive | Statement | E | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 2750.0 | Codeforces Round 1063 Editorial | |
| 354 | Pointless Machine | interactive | Statement | G | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 3500.0 | Codeforces Global Round 30 Editorial | |
| 1667 | Locate | binary search constructive algorithms greedy interactive | Statement | B | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 934 | Intercepting Butterflies | bitmasks constructive algorithms graphs interactive | Statement | C | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 3613 | Encode and Decode (Hard Version) | bitmasks interactive math | Statement | A2 | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 5414 | Encode and Decode (Easy Version) | constructive algorithms interactive | Statement | A1 | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 1666 | Shiro's Mirror Duel | interactive probabilities | Statement | E | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 2250.0 | ||
| 119 | Game of Scientists (Version 2) | brute force chinese remainder theorem interactive math | Statement | E2 | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 1750.0 | Codeforces Round 1069 Editorial | |
| 166 | Game of Scientists (Version 1) | chinese remainder theorem interactive math | Statement | E1 | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 1750.0 | Codeforces Round 1069 Editorial | |
| 3818 | Flatten or Concatenate | binary search divide and conquer interactive | Statement | E | Good Bye 2025 {2178} | PROGRAMMING | 2250.0 | ||
| 1332 | Blackslex and Penguin Migration | brute force interactive math | Statement | G | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 2981 | Blackslex and Another RGB Walking | graphs interactive number theory | Statement | F | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 178 | Cacti Classification | binary search interactive math | Statement | C | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 254 | Snake Instructions | interactive | Statement | G | Hello 2026 {2183} | PROGRAMMING | 4000.0 | ||
| 1399 | Comparable Permutations | binary search greedy interactive sortings two pointers | Statement | C | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 1750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 2465 | Paths in a Tree | dfs and similar interactive sortings trees | Statement | G | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 4012 | Interactive Graph (Simple Version) | combinatorics dfs and similar dp graphs interactive | Statement | C1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 2837 | Interactive Graph (Hard Version) | combinatorics dfs and similar dp graphs interactive | Statement | C2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 153 | Compare Suffixes | interactive | Statement | A | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 65 | Bowser's Castle (Easy Version) | binary search constructive algorithms divide and conquer greedy interactive trees | Statement | H1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 57 | Bowser's Castle (Medium Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H2 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1000.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 76 | Bowser's Castle (Hard Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H3 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1500.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 12202 | Find the Zero | constructive algorithms interactive | Statement | C | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1500.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 393 | 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 | |
| 1061 | Minimum Path Cover | dp interactive number theory trees | Statement | E | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 921 | Oriented Journey | bitmasks communication constructive algorithms graphs hashing interactive trees | Statement | C | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1750.0 | 152930 | |
| 3933 | 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 | |
| 4379 | Unique Values (Easy version) | binary search divide and conquer interactive | Statement | B1 | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 750.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 2480 | Seek the Truth | binary search bitmasks interactive | Statement | E | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 2250.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 455 | Send GCDs | communication interactive math | Statement | G | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2750.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 187 | NPC Challenge | divide and conquer interactive | Statement | G | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 3500.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 688 | lce4113 and Security Game | bitmasks interactive probabilities | Statement | E | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 2250.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 1615 | Even If the World Turns | communication greedy interactive math number theory | Statement | C | Codeforces Round 1116 (Div. 1) {2255} | PROGRAMMING | 1750.0 | 155840 | |
| 5099 | Far Cities | interactive trees two pointers | Statement | C | Codeforces Round 1118 (Div. 2) {2258} | PROGRAMMING | 1250.0 | Codeforces Round 1118 (Div. 2) Editorial |