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 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6112 | Non Prime Tree | brute force constructive algorithms dfs and similar greedy number theory trees two pointers | Statement | D | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24796 | Paint a Strip | constructive algorithms greedy math | Statement | B | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 11190 | Ordered Permutations | constructive algorithms greedy math | Statement | C | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24798 | Harder Problem | constructive algorithms greedy math | Statement | D | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 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) | |
| 111 | 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) | |
| 239 | 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) | |
| 3618 | Kevin and Bipartite Graph | constructive algorithms graphs greedy | Statement | E | Codeforces Global Round 28 {2048} | PROGRAMMING | 1750.0 | Tutorial | |
| 21110 | Kevin and Permutation | constructive algorithms greedy | Statement | B | Codeforces Global Round 28 {2048} | PROGRAMMING | 500.0 | Tutorial | |
| 19415 | pspspsps | brute force constructive algorithms implementation | Statement | B | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 14091 | MEX Cycle | constructive algorithms greedy implementation | Statement | C | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1000.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 28746 | Preparing for the Exam | constructive algorithms implementation | Statement | C | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 3944 | Fix Flooded Floor | constructive algorithms dp | Statement | F | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 74 | Cactus without Bridges | constructive algorithms math | Statement | C | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 88 | Delicate Anti-monotonous Operations | constructive algorithms implementation | Statement | H | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 511 | Haystacks | constructive algorithms data structures greedy | Statement | E | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3000.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 34141 | Two Frogs | constructive algorithms games greedy | Statement | A | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 17768 | The Trail | constructive algorithms greedy math | Statement | C | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 19958 | Palindromic Subsequences | constructive algorithms math | Statement | C | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1500.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 14267 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 | ||
| 27855 | MEX Table | constructive algorithms greedy | Statement | A | Hello 2025 {2057} | PROGRAMMING | 500.0 | ||
| 822 | Secret Message | constructive algorithms math | Statement | G | Hello 2025 {2057} | PROGRAMMING | 3750.0 | ||
| 360 | Stop Gaming (Hard Version) | brute force constructive algorithms data structures | Statement | E2 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 12965 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 912 | Stop Gaming (Easy Version) | brute force constructive algorithms greedy hashing | Statement | E1 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 19285 | Cost of the Array | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1000.0 | 139094 | |
| 29557 | Milya and Two Arrays | constructive algorithms greedy sortings | Statement | A | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 500.0 | 139094 | |
| 15084 | 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 | |
| 565 | Kevin and Teams | constructive algorithms graphs interactive | Statement | G | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 3000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 22575 | 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 | |
| 18362 | Remove the Ends | brute force constructive algorithms dp greedy | Statement | C | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1250.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 20572 | Variety is Discouraged | constructive algorithms constructive algorithms greedy greedy | Statement | B | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1000.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 57530 | Skibidus and Amog'u | brute force constructive algorithms implementation strings | Statement | A | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 12537 | Skibidus and Rizz | constructive algorithms greedy | Statement | E | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 80 | Curse | constructive algorithms dp math | Statement | F | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 3000.0 | 139415 | |
| 5644 | White Magic | constructive algorithms greedy implementation | Statement | B | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 26088 | Adjacent Digit Sums | constructive algorithms math | Statement | A | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 500.0 | ||
| 1050 | Condorcet Elections | constructive algorithms graphs probabilities | Statement | A | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 437 | Statues | constructive algorithms greedy | Statement | H | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 1997 | A, B, AB and BA | constructive algorithms greedy sortings strings | Statement | E | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 1143 | 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 | |
| 21451 | 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 | |
| 10038 | Trapmigiano Reggiano | constructive algorithms dfs and similar sortings trees | Statement | C | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1500.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 12785 | 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 | ||
| 8797 | 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 | ||
| 20183 | Creating Keys for StORages Has Become My Main Skill | bitmasks constructive algorithms greedy | Statement | C | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 31746 | Having Been a Treasurer in the Past, I Help Goblins Deceive | combinatorics constructive algorithms strings | Statement | B | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 279 | 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 | |
| 3824 | 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 | |
| 15115 | 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 | |
| 18757 | 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 | |
| 49 | Strong Connectivity Strikes Back | *special constructive algorithms graphs | Statement | A | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
| 1253 | 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 | |
| 149 | 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 | |
| 9236 | 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 | |
| 527 | Skyscape | constructive algorithms data structures greedy | Statement | F | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 3000.0 | 141155 | |
| 12157 | You Soared Afar With Grace | constructive algorithms greedy implementation | Statement | C | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1500.0 | 141155 | |
| 17649 | Max and Mod | constructive algorithms math | Statement | A | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 750.0 | 141155 | |
| 14190 | Serval and The Formula | bitmasks constructive algorithms greedy | Statement | C | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1250.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 3288 | 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 | |
| 24092 | Serval and String Theory | constructive algorithms implementation | Statement | A | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 500.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 17607 | Serval and Final MEX | constructive algorithms implementation | Statement | B | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 1250.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 146 | Online Palindrome | brute force constructive algorithms interactive | Statement | F | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 7521 | Simple Permutation | constructive algorithms number theory | Statement | A | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 750.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 1669 | 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 | ||
| 29616 | Combination Lock | constructive algorithms greedy | Statement | C | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 7059 | Mishkin Energizer | brute force constructive algorithms greedy implementation strings | Statement | D | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 1750.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 450 | 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 | |
| 3947 | She knows... | combinatorics constructive algorithms graphs math | Statement | E | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 2250.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 23360 | 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 | |
| 20988 | Wonderful Sticks | constructive algorithms greedy | Statement | A | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 500.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 1070 | Bermuda Triangle | chinese remainder theorem constructive algorithms geometry math number theory | Statement | C | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 1500.0 | 142316 | |
| 15830 | Mex in the Grid | constructive algorithms implementation | Statement | A | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 500.0 | 142788 | |
| 22179 | Dinner Time | constructive algorithms math | Statement | A | Codeforces Round 1024 (Div. 2) {2102} | PROGRAMMING | 250.0 | 142788 | |
| 643 | Keep the Sum | constructive algorithms data structures | Statement | E | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 2750.0 | 142149 | |
| 4106 | Local Construction | constructive algorithms dfs and similar graphs implementation two pointers | Statement | D | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 2000.0 | 142149 | |
| 29150 | St. Chroma | constructive algorithms greedy math | Statement | B | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 12648 | 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 | |
| 967 | 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 | |
| 15028 | SUMdamental Decomposition | bitmasks constructive algorithms greedy implementation math | Statement | B | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1250.0 | Codeforces Round 1022 Editorial | |
| 944 | Spruce Dispute | constructive algorithms dfs and similar graphs implementation shortest paths trees | Statement | E | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2750.0 | Codeforces Round 1022 Editorial | |
| 11976 | 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 | |
| 9063 | 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 | |
| 3472 | 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 | |
| 16445 | Racing | constructive algorithms dp greedy | Statement | C | Codeforces Round 1026 (Div. 2) {2110} | PROGRAMMING | 1500.0 | Codeforces Round 1026 (Div. 2) Editorial | |
| 1480 | Puzzle | brute force constructive algorithms greedy math | Statement | F | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 12506 | 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 | ||
| 9911 | Reachability and Tree | constructive algorithms dfs and similar dp trees | Statement | D | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 2996 | Cheater | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 1750.0 | Codeforces Round #1031 Editorial | |
| 8350 | Smilo and Minecraft | brute force constructive algorithms dp greedy | Statement | C | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 1250.0 | Codeforces Round #1031 Editorial | |
| 1012 | Two Arrays | constructive algorithms dfs and similar graphs math | Statement | F | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 3000.0 | Codeforces Round #1031 Editorial | |
| 17734 | 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 | |
| 5984 | Gellyfish and Camellia Japonica | constructive algorithms dfs and similar dp graphs greedy | Statement | B | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 1250.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 29594 | Equal Subsequences | constructive algorithms greedy | Statement | A | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 1460 | Grid Coloring | constructive algorithms greedy sortings | Statement | E | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 2500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 17012 | A Good Problem | bitmasks constructive algorithms math | Statement | C | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 13158 | 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 | |
| 33059 | Above the Clouds | constructive algorithms greedy strings | Statement | B | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 215 | Colorful Polygon | constructive algorithms divide and conquer geometry | Statement | F | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 3250.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 21666 | Greedy Grid | constructive algorithms greedy | Statement | A | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 10679 | 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 | |
| 22828 | Binary String Battle | constructive algorithms games greedy | Statement | D | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 10295 | Minimize Fixed Points | constructive algorithms number theory | Statement | F | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 5856 | 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 | |
| 776 | 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 | |
| 21622 | Deranged Deletions | constructive algorithms sortings | Statement | A | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 500.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 28768 | Difficult Contest | constructive algorithms implementation sortings strings | Statement | A | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 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 | |
| 5450 | 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 | |
| 22213 | 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 | |
| 835 | 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 | |
| 22348 | Deque Process | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1000.0 | Codeforces Round #1039 — Editorial | |
| 2327 | 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 | |
| 3913 | 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 | |
| 16221 | 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 | |
| 19370 | Double Perspective | constructive algorithms dp dsu greedy | Statement | A | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 937 | 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 | ||
| 31758 | Alternating Series | constructive algorithms greedy math | Statement | B | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 1817 | I Yearned For The Mines | constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 2750.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 3813 | Sliding Tree | constructive algorithms dfs and similar trees | Statement | D | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 2000.0 | 145832 | |
| 2554 | Power Boxes | constructive algorithms dp interactive | Statement | E | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 2250.0 | 145832 | |
| 27658 | Painting With Two Colors | constructive algorithms implementation math | Statement | A | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 500.0 | 145832 | |
| 22257 | Add 0 or K | constructive algorithms math number theory | Statement | B | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 1250.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 | |
| 21932 | 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 | |
| 36707 | Collatz Conjecture | constructive algorithms math | Statement | A | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 27799 | Fun Permutation | constructive algorithms math number theory | Statement | B | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 282 | Determinant Construction (Easy Version) | constructive algorithms matrices | Statement | E1 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 2750.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 227 | Determinant Construction (Hard Version) | constructive algorithms matrices | Statement | E2 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 23626 | 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 | |
| 2138 | Make Good | constructive algorithms math strings | Statement | E | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 2500.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 1123 | Bracket Groups | constructive algorithms dp strings | Statement | F | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 19544 | Maximum Cost Permutation | constructive algorithms greedy | Statement | B | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 7171 | 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 | ||
| 4331 | Max Sum OR (Hard Version) | bitmasks constructive algorithms divide and conquer greedy | Statement | D2 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 11399 | Max Sum OR (Easy Version) | bitmasks constructive algorithms divide and conquer greedy trees | Statement | D1 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 2219 | 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 | |
| 318 | Cycle Closing | constructive algorithms graphs trees | Statement | F | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 3250.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 | |
| 5199 | Catshock | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1750.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 20923 | Make it Zigzag | constructive algorithms greedy | Statement | B | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1000.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 18122 | Abraham's Great Escape | constructive algorithms graphs | Statement | B | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 1000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 5627 | 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 | |
| 27936 | Pizza Time | brute force constructive algorithms greedy | Statement | A | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 500.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 | |
| 1891 | 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 | |
| 11986 | 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 | |
| 3539 | 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 | |
| 311 | 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 | |
| 475 | Distinct GCDs (Easy Version) | constructive algorithms constructive algorithms graphs graphs number theory number theory | Statement | F1 | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 15045 | Split | constructive algorithms greedy math | Statement | B | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1250.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 9694 | MAD Interactive Problem | constructive algorithms implementation interactive | Statement | A | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 750.0 | Codeforces Round 1058 Editorial | |
| 13648 | Loyalty | constructive algorithms greedy sortings two pointers | Statement | C | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1750.0 | ||
| 3084 | Beautiful Intervals | constructive algorithms greedy | Statement | F | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 10016 | Beautiful Palindromes | constructive algorithms greedy schedules | Statement | E | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 2965 | Beautiful Tree | constructive algorithms math trees | Statement | G | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 9666 | Siga ta Kymata | constructive algorithms math | Statement | B | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1000.0 | Codeforces Round 1063 Editorial | |
| 17099 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 37831 | Isamatdin and His Magic Wand! | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 1669 | 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) | ||
| 5415 | Encode and Decode (Easy Version) | constructive algorithms interactive | Statement | A1 | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 2414 | 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 | ||
| 1795 | Almost Roman | constructive algorithms greedy implementation | Statement | D | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 7870 | 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 | ||
| 3871 | Anisphia Wynn Palettia and Good Permutations | constructive algorithms greedy number theory | Statement | E | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 6608 | Number Maze | constructive algorithms implementation | Statement | E | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 7102 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 14419 | Blackslex and Penguin Civilization | bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6170 | Blackslex and Girls | constructive algorithms geometry math | Statement | E | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6856 | 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 | |
| 169 | Elevator Against Humanity | brute force constructive algorithms greedy sortings | Statement | E | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 2636 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 9550 | Tree Coloring (Easy Version) | constructive algorithms dfs and similar greedy trees | Statement | D1 | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 16907 | Yet Another MEX Problem | constructive algorithms greedy | Statement | B | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 47055 | Perfect Root | constructive algorithms math | Statement | A | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 17079 | Restricted Sorting | binary search constructive algorithms greedy sortings | Statement | A | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 5786 | Shortest Statement Ever | bitmasks constructive algorithms dp greedy | Statement | B | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 1250.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 15012 | 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 | |
| 6640 | 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 | |
| 11806 | Sub-RBS (Easy Version) | combinatorics constructive algorithms dp greedy strings two pointers | Statement | B1 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 21310 | MEX Reordering | constructive algorithms sortings | Statement | B | Codeforces Round 1073 (Div. 2) {2191} | PROGRAMMING | 1000.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 2350 | Swap to Rearrange | constructive algorithms dfs and similar graph matchings graphs greedy strings | Statement | E | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 2250.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 16328 | Flipping Binary String | constructive algorithms strings | Statement | B | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1000.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 8962 | Table Cut | constructive algorithms greedy | Statement | D | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2000.0 | Codeforces Round #1078 Editorial | |
| 547 | Codeforces Heuristic Contest 001 | brute force constructive algorithms geometry implementation | Statement | H | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 138 | Indivisible | constructive algorithms graphs | Statement | F | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 3500.0 | Tutorial | |
| 579 | Minesweeper | *special constructive algorithms greedy | Statement | C | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 5365 | 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 | ||
| 748 | 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 | |
| 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 | |
| 1883 | N-MEX (Constructive Version) | constructive algorithms greedy | Statement | E1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1750.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 4969 | Tree Orientation (Easy Version) | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | D1 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 22435 | Bingo Candies | constructive algorithms math | Statement | A | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 500.0 | Tutorial | |
| 6075 | Ghostfires | constructive algorithms greedy | Statement | D | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1750.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 12207 | Find the Zero | constructive algorithms interactive | Statement | C | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1500.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 25215 | A Simple Sequence | constructive algorithms dp greedy number theory | Statement | A | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 500.0 | Codeforces Round 1089 (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 | |
| 2340 | A Simple RBS Problem | constructive algorithms strings trees | Statement | D | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 2250.0 | Codeforces Round 1089 (Div. 2) 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 | |
| 241 | 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 | |
| 4069 | 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 | |
| 2574 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 32167 | The 67th Permutation Problem | constructive algorithms greedy math | Statement | C | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 9523 | The 67th Tree Problem | constructive algorithms implementation trees | Statement | F | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 3936 | 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 | |
| 162 | Weird Chessboard | constructive algorithms math | Statement | E | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 3000.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 4259 | Permutation Construction | constructive algorithms sortings | Statement | D | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 2000.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 8399 | 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 | |
| 12393 | Zhily and Array Operating | constructive algorithms greedy | Statement | A | Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026) {2224} | PROGRAMMING | 500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 9693 | 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 | |
| 1339 | Covering Points with Circles | constructive algorithms data structures geometry probabilities | Statement | E | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 3368 | Reserved Reversals | constructive algorithms dp greedy | Statement | D | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2000.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 14909 | 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 | ||
| 23801 | Snowfall | constructive algorithms math | Statement | C | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 3985 | Maximum Prefix Sums | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2000.0 | ||
| 850 | Quadratic Jumps | constructive algorithms greedy math number theory | Statement | F | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2750.0 | ||
| 2836 | Magical Tiered Cake | constructive algorithms dfs and similar dp greedy | Statement | D | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 2000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 9110 | XOR, Expression and Two Binary Numbers | bitmasks constructive algorithms math number theory | Statement | D | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 1750.0 | Tutorial | |
| 22824 | Palindrome, Twelve and Two Terms | constructive algorithms math | Statement | B | Codeforces Round 1102 (Div. 2) {2234} | PROGRAMMING | 750.0 | Tutorial | |
| 13342 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 2158 | Permutation Commutation | constructive algorithms graphs greedy | Statement | E | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 2250.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 6648 | Fullmetal Bitchemist | constructive algorithms greedy math | Statement | D | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1750.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial | |
| 1547 | 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 | |
| 9608 | Nim Game Is XOR Game | bitmasks constructive algorithms games greedy math | Statement | A | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 750.0 | Codeforces Round 1105 (Div. 1, Div. 2) Editorial | |
| 21606 | Good times Good times | constructive algorithms math | Statement | B | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 1616 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 13759 | Yaroslav and Productivity | constructive algorithms dp greedy math number theory | Statement | D | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 18003 | Stepan and Permutation | constructive algorithms dsu greedy math number theory sortings | Statement | C | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 2245 | Construct an Array (Hard Version) | 2-sat constructive algorithms dfs and similar implementation | Statement | D2 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 1000.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 7218 | MEXOR | bitmasks constructive algorithms math | Statement | C | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) {2245} | PROGRAMMING | 1250.0 | Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Editorial | |
| 17608 | ezraft and Array | constructive algorithms number theory | Statement | B | Codeforces Round 1108 (Div. 2) {2246} | PROGRAMMING | 750.0 | Codeforces Round 1108 (Div. 2) Editorial | |
| 7498 | Good Pair Queries | constructive algorithms greedy math | Statement | D | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 1750.0 | Codeforces Round 1113 (Div. 2) Editorial | |
| 1167 | Xor Permutation Matrix | bitmasks chinese remainder theorem constructive algorithms math | Statement | D | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 2250.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 208 | Even Simple Path | constructive algorithms graphs shortest paths | Statement | F | Codeforces Round 1112 (Div. 1) {2249} | PROGRAMMING | 3500.0 | Codeforces Round 1112 (Div. 1, Div. 2) Editorial | |
| 3469 | Whiplash | bitmasks constructive algorithms math | Statement | F | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 10882 | Silhouette | constructive algorithms math sortings | Statement | D | Codeforces Round 1114 (Div. 3) {2254} | PROGRAMMING | Tutorial | ||
| 6087 | Treasure Map Destruction (Constructive Version) | 2-sat constructive algorithms greedy | Statement | E | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | |||
| 17722 | 101 | constructive algorithms greedy | Statement | C | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | |||
| 12981 | MEX Multiset | constructive algorithms greedy | Statement | D | Codeforces Round 1119 (Div. 3) {2259} | PROGRAMMING | |||
| 4654 | Signs of Prefix Sums | brute force constructive algorithms dfs and similar dp | Statement | D | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | |||
| 1809 | Cyclic Balance | constructive algorithms math | Statement | E | Educational Codeforces Round 194 (Rated for Div. 2) {2260} | PROGRAMMING | |||
| 294 | PLUSworld | constructive algorithms graphs | Statement | D | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 2500.0 | ||
| 8954 | Floor of MEX (Easy Version) | constructive algorithms greedy | Statement | A1 | Codeforces Round 1120 (Div. 1) {2262} | PROGRAMMING | 500.0 |