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 |
|---|---|---|---|---|---|---|---|---|---|
| 20129 | Fun | binary search brute force number theory | Statement | D | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 12978 | Decode | brute force combinatorics implementation | Statement | E | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 2415 | Penacony | brute force data structures dp hashing | Statement | G | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 3909 | Level Up | binary search brute force data structures implementation | Statement | E | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 2355 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 943 | Eliminating Balls With Merging (Hard Version) | binary search brute force data structures divide and conquer implementation | Statement | E2 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 7267 | Perform Operations to Maximize Score | binary search brute force greedy | Statement | C | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1250.0 | Video Tutorial | |
| 42917 | Card Game | brute force implementation | Statement | B | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 3271 | Call During the Journey | binary search brute force graphs greedy shortest paths | Statement | G | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 13173 | Guess The Tree | binary search brute force greedy interactive trees | Statement | C | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 1585 | Deterministic Heap (Easy Version) | brute force combinatorics dp | Statement | E1 | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 6693 | Longest Max Min Subsequence | brute force constructive algorithms greedy two pointers | Statement | D | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 18067 | 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 | |
| 1034 | Court Blue (Easy Version) | brute force dfs and similar dp math number theory | Statement | F1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 615 | Court Blue (Hard Version) | brute force dp math number theory | Statement | F2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 665 | Turtle and Inversions (Hard Version) | brute force constructive algorithms data structures dp greedy two pointers | Statement | E2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 914 | Turtle and Inversions (Easy Version) | brute force data structures dp greedy | Statement | E1 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1750.0 | sol-zh.pdf | |
| 1459 | Make a Palindrome | brute force data structures dp greedy math | Statement | F | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 32395 | Game with Doors | brute force implementation | Statement | B | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 181 | Dora's Paint | brute force combinatorics constructive algorithms graphs | Statement | F | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 3000.0 | Tutorial | |
| 4479 | Iris and the Tree | brute force data structures dfs and similar dsu math trees | Statement | B | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 1250.0 | Tutorial | |
| 6873 | Sakurako's Task | binary search brute force greedy math number theory | Statement | G | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 3721 | Sakurako's Test | binary search brute force greedy math number theory | Statement | H | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 37261 | Longest Good Array | binary search brute force math | Statement | C | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 42583 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 14116 | Alternating String | brute force data structures dp greedy strings | Statement | E | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 54708 | osu!mania | brute force implementation | Statement | B | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 76239 | Minimize! | brute force math | Statement | A | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 25141 | Three Brothers | brute force implementation math | Statement | B | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 800 | ||
| 14967 | Password Cracking | brute force constructive algorithms interactive strings | Statement | C | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 1250.0 | 134298 | |
| 4457 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | 134298 | |
| 10388 | Tree Pruning | brute force data structures dfs and similar greedy sortings trees | Statement | C | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 12942 | Cards Partition | brute force greedy implementation math | Statement | A | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 27686 | Max Plus Size | brute force dp greedy | Statement | A | Codeforces Round 975 (Div. 2) {2019} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 4175 | Expected Power | bitmasks brute force dp math number theory probabilities | Statement | E | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2000.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 7645 | Connect the Dots | brute force dfs and similar dp dsu graphs math trees | Statement | D | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1982 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 19316 | Maximize Mex | brute force greedy math number theory | Statement | B | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1409 | 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 | |
| 7378 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | 135341 | |
| 618 | Many Games | brute force dp math | Statement | D | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 2250.0 | 135341 | |
| 19628 | New Game | binary search brute force greedy implementation two pointers | Statement | C | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 8149 | Attribute Checks | brute force data structures dp implementation math | Statement | D | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 16943 | Black Cells | binary search brute force greedy | Statement | B | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 20675 | Perpendicular Segments | brute force geometry math | Statement | A | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 277 | Bit Game (Easy Version) | bitmasks brute force games math | Statement | E1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 2000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 18111 | Stalin Sort | brute force greedy | Statement | B | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 20874 | Alice's Adventures in ''Chess'' | brute force implementation math strings | Statement | A | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 3640 | 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 | |
| 1231 | Orangutan Approved Subarrays | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2500.0 | Codeforces Round 979 Editorial | |
| 24183 | Minimise Oneness | brute force combinatorics constructive algorithms | Statement | B | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 500.0 | Codeforces Round 979 Editorial | |
| 2036 | MEXimize the Score | brute force combinatorics data structures dp math | Statement | E | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2000.0 | Codeforces Round 979 Editorial | |
| 27985 | A Gift From Orangutan | brute force dfs and similar greedy sortings | Statement | A | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 250.0 | Codeforces Round 979 Editorial | |
| 20337 | A TRUE Battle | brute force games greedy | Statement | C | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1000.0 | Codeforces Round 979 Editorial | |
| 16194 | 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 | |
| 14915 | Sakurako, Kosuke, and the Permutation | brute force data structures dfs and similar dsu fft greedy math | Statement | E | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 7372 | Kosuke's Sloth | brute force math number theory | Statement | F | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 18713 | King Keykhosrow's Mystery | brute force chinese remainder theorem math number theory | Statement | A | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 500.0 | Rayan 2024 Selection Round Editorial | |
| 2085 | 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 | |
| 5966 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | Codeforces Global Round 27 Editorial | |
| 2002 | Monster | binary search brute force math | Statement | E | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | Codeforces Global Round 27 Editorial | |
| 22664 | Anya and 1100 | brute force data structures implementation | Statement | C | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 16405 | I Love 1543 | brute force implementation matrices | Statement | D | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 25893 | Intercepted Inputs | brute force implementation | Statement | B | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 8447 | Bridge Renovation | brute force dp greedy math | Statement | L | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1400 | ||
| 1997 | Make It Equal | binary search brute force greedy math | Statement | B | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 13941 | Shohag Loves XOR (Easy Version) | bitmasks brute force math number theory | Statement | C1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 5137 | Shohag Loves XOR (Hard Version) | bitmasks brute force math number theory | Statement | C2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1500.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 6090 | 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 | |
| 24825 | Game of Division | brute force games math | Statement | A | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 527 | Segmentation Folds | brute force dfs and similar number theory | Statement | F | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 547 | Vertex Pairs | binary search brute force dfs and similar dp greedy trees | Statement | E | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 344 | Problem with Queries | binary search brute force data structures | Statement | G | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 11598 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 1879 | Matrix Transformation | bitmasks brute force dfs and similar graphs implementation | Statement | E | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 27296 | Coin Transformation | brute force math | Statement | A | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 7970 | Problem about GCD | brute force math number theory | Statement | D | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 6505 | Easy Demon Problem | binary search brute force math number theory | Statement | F | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 63773 | Easy Problem | brute force math | Statement | A | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 2709 | Scrambled Scrabble | brute force greedy | Statement | A | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 1700 | |
| 2345 | Mirror Maze | brute force dfs and similar graphs implementation | Statement | M | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 1800 | |
| 19803 | Replace Character | brute force combinatorics greedy strings | Statement | B | Codeforces Round 990 (Div. 2) {2047} | PROGRAMMING | 1000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 15541 | Kevin and Binary Strings | bitmasks brute force greedy strings | Statement | C | Codeforces Global Round 28 {2048} | PROGRAMMING | 1000.0 | Tutorial | |
| 1365 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | Tutorial | |
| 23097 | Kevin and Combination Lock | brute force implementation math number theory | Statement | A | Codeforces Global Round 28 {2048} | PROGRAMMING | 250.0 | Tutorial | |
| 19374 | pspspsps | brute force constructive algorithms implementation | Statement | B | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 25886 | Uninteresting Number | brute force dp math | Statement | C | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 27923 | Transfusion | brute force greedy math | Statement | B | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 19630 | Digital string maximization | brute force greedy math strings | Statement | D | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 12443 | Best Price | brute force data structures greedy sortings | Statement | E | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 1254 | DAG Serialization | brute force graphs | Statement | D | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 17355 | Outstanding Impressionist | binary search brute force greedy | Statement | B | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 233 | Naive String Splits | brute force greedy hashing strings | Statement | G | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4250.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 91 | Cosmic Divide | brute force geometry hashing math strings | Statement | F | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 3756 | Unique Median | brute force data structures divide and conquer | Statement | D | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2000.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 2715 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 2030 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 357 | Stop Gaming (Hard Version) | brute force constructive algorithms data structures | Statement | E2 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 12941 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 911 | Stop Gaming (Easy Version) | brute force constructive algorithms greedy hashing | Statement | E1 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 19259 | Cost of the Array | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1000.0 | 139094 | |
| 41909 | Fibonacciness | brute force | Statement | A | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 2324 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 4116 | Kevin and And | bitmasks brute force dp greedy | Statement | E | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 15057 | 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 | |
| 11168 | Kevin and Numbers | brute force data structures greedy implementation math | Statement | D | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 18872 | Cirno and Operations | brute force constructive algorithms | Statement | C | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 1000.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 15432 | Remove Exactly Two | brute force data structures dp graphs greedy sortings trees | Statement | C | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 18326 | 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 | |
| 57390 | Skibidus and Amog'u | brute force constructive algorithms implementation strings | Statement | A | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 13136 | Devyatkino | brute force dp greedy math | Statement | C | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 1250.0 | ||
| 1572 | Mascot Naming | brute force greedy strings | Statement | F | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 26832 | Was there an Array? | brute force greedy | Statement | A | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 20131 | Robot Program | brute force implementation math | Statement | B | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 26810 | FizzBuzz Remixed | brute force math | Statement | A | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 21409 | 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 | |
| 18135 | For Wizards, the Exam Is Easy, but I Couldn't Handle It | brute force greedy implementation | Statement | D | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 2210 | I've Been Flipping Numbers for 300 Years and Calculated the Sum | brute force math number theory | Statement | G | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 22533 | XOR and Triangle | binary search bitmasks brute force greedy | Statement | C | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 12445 | Counting Points | brute force geometry implementation two pointers | Statement | D | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 6094 | Equalization | bitmasks brute force dp greedy math | Statement | D | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 397 | Maximum Polygon | brute force data structures implementation math | Statement | D | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 9217 | 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 | |
| 3278 | 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 | |
| 19487 | Large Array and Segments | binary search brute force dp greedy math | Statement | B | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 1715 | Zebra-like Numbers | bitmasks brute force dfs and similar dp math | Statement | E | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 144 | Online Palindrome | brute force constructive algorithms interactive | Statement | F | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 1503 | Key of Like (Easy Version) | dp math probabilities | Statement | C1 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 1000.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 272 | Key of Like (Hard Version) | dp math probabilities | Statement | C2 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 1250.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 6363 | Igor and Mountain | binary search brute force dp | Statement | F | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 1660 | 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 | ||
| 20380 | Interesting Ratio | brute force math number theory two pointers | Statement | E | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 7052 | 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 | |
| 448 | 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 | |
| 4077 | Shorten the Array | binary search brute force data structures dfs and similar greedy strings trees two pointers | Statement | G | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 14069 | Min Max MEX | binary search brute force greedy | Statement | E | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 6072 | Hackers and Neural Networks | bitmasks brute force greedy | Statement | F | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 3959 | La Vaca Saturno Saturnita | binary search brute force math number theory | Statement | H | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 34026 | Bobritto Bandito | brute force constructive algorithms | Statement | B | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 3800 | Would It Be Unrated? | *special brute force | Statement | C | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 15010 | Vadim's Collection | brute force greedy | Statement | A | Codeforces Round 1021 (Div. 2) {2098} | PROGRAMMING | 500.0 | 142316 | |
| 25301 | Common Multiple | brute force greedy math | Statement | A | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 500.0 | 142149 | |
| 21478 | Move to the End | brute force data structures dp greedy | Statement | B | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 755 | Numbers and Strings | brute force dfs and similar dp implementation math | Statement | F | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 17879 | Card Game | brute force games greedy math | Statement | C | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 37325 | Dr. TC | brute force math | Statement | A | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 3662 | Apple Tree Traversing | brute force dfs and similar greedy implementation trees | Statement | D | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2000.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 2493 | 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 | |
| 1981 | Faculty | brute force math number theory | Statement | F | Codeforces Round 1026 (Div. 2) {2110} | PROGRAMMING | 3000.0 | Codeforces Round 1026 (Div. 2) Editorial | |
| 1474 | Puzzle | brute force constructive algorithms greedy math | Statement | F | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 435 | Divisible Subarrays | brute force data structures interactive | Statement | G | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 18376 | Fibonacci Cubes | brute force dp implementation math | Statement | B | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 20257 | Equal Values | brute force two pointers | Statement | C | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 18371 | Coloring Game | binary search brute force greedy two pointers | Statement | C | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 21707 | Shrinking Array | brute force greedy | Statement | B | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 8318 | Smilo and Minecraft | brute force constructive algorithms dp greedy | Statement | C | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 1250.0 | Codeforces Round #1031 Editorial | |
| 435 | From Kazan with Love | brute force graphs trees | Statement | E | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 2500.0 | Codeforces Round #1031 Editorial | |
| 5681 | Small Operations | binary search bitmasks brute force dfs and similar dp math number theory sortings | Statement | F | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 44627 | Square Year | binary search brute force math | Statement | A | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 15131 | Come a Little Closer | brute force greedy implementation math | Statement | D | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 17536 | 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 | |
| 5494 | Omg Graph | brute force dsu graphs greedy shortest paths sortings | Statement | G | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 8704 | Red Light, Green Light (Easy version) | brute force dfs and similar dp graphs implementation | Statement | D1 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1250.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 2337 | Ice Baby | binary search brute force data structures dp implementation sortings | Statement | H | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 8437 | Yamakasi | binary search brute force data structures greedy | Statement | F | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 40101 | Letter Home | brute force math | Statement | A | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 3075 | Traffic Lights | brute force dp graphs shortest paths | Statement | D | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 2000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 32013 | Prefix Min and Suffix Max | brute force data structures | Statement | C | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 3465 | Modular Sorting | brute force data structures math number theory | Statement | G | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 2693 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 3925 | Wafu! | bitmasks brute force dp math | Statement | G | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 932 | 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 | ||
| 45554 | Homework | brute force implementation strings | Statement | A | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 7909 | Chicken Jockey | binary search brute force dp greedy math | Statement | D | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 2250.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 32079 | Redstone? | brute force implementation math | Statement | A | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 500.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 1448 | 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 | |
| 24037 | Maximum Even Sum | brute force greedy implementation math | Statement | C | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 686 | Antiamuny and Slider Movement | binary search brute force combinatorics implementation math | Statement | D | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 2500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 3620 | Maple and Tree Beauty (Hard Version) | bitmasks brute force dfs and similar divide and conquer dp fft trees | Statement | C2 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 750.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 360 | Minimum on Subarrays | *special brute force | Statement | C | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 22521 | Cut the Array | brute force math number theory | Statement | A | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 32478 | Candies for Nephews | brute force math | Statement | A | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 349 | Bubble Sort | brute force combinatorics dp | Statement | F | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 3500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 2216 | 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 | |
| 22687 | Equal Occurrences | brute force greedy implementation | Statement | A | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 2339 | Maximum OR Popcount | binary search bitmasks brute force data structures greedy | Statement | E | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2500.0 | ||
| 50451 | Sublime Sequence | brute force math | Statement | A | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 2889 | Buratsuta 3 | binary search brute force data structures divide and conquer probabilities | Statement | G | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 4703 | 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 | |
| 3929 | Triple Attack | brute force data structures greedy trees two pointers | Statement | F | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 1050 | Zero Trailing Factorial | brute force math number theory | Statement | E | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 2250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 11103 | The Ancient Wizards' Capes | brute force dp implementation | Statement | C | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 1750.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 21839 | Strange Machine | binary search brute force greedy implementation | Statement | B | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 750.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 27811 | Pizza Time | brute force constructive algorithms greedy | Statement | A | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 500.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 1692 | Strange Operation (Easy Version) | brute force data structures greedy implementation | Statement | F1 | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 3250.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 521 | Keygen 3 | brute force combinatorics constructive algorithms | Statement | H | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3750.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 925 | 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 | |
| 3489 | 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 | |
| 5642 | Make Connected | brute force dsu implementation | Statement | B | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1000.0 | ||
| 43280 | Beautiful Average | brute force greedy | Statement | A | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 13306 | Dungeon | binary search brute force data structures greedy sortings | Statement | C | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1500.0 | Codeforces Global Round 30 Editorial | |
| 23313 | Sequence Game | brute force greedy | Statement | A | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 500.0 | Codeforces Global Round 30 Editorial | |
| 21121 | Even Modulo Pair | brute force probabilities | Statement | B | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 750.0 | Codeforces Global Round 30 Editorial | |
| 16870 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 23985 | Same Difference | brute force dp strings | Statement | A | Codeforces Round 1064 (Div. 2) {2166} | PROGRAMMING | 500.0 | Codeforces Round 1064 (Div. 1, Div. 2) Editorial | |
| 32073 | Yet Another Array Problem | brute force math number theory | Statement | D | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 3932 | Taiga's Carry Chains | bitmasks brute force dp greedy | Statement | D | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1750.0 | ||
| 116 | 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 | |
| 26813 | Yes or Yes | brute force greedy strings | Statement | A | Good Bye 2025 {2178} | PROGRAMMING | 500.0 | ||
| 1326 | Blackslex and Penguin Migration | brute force interactive math | Statement | G | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 26608 | Carnival Wheel | brute force number theory | Statement | A | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 500.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 | ||
| 6650 | Battle of Arrays | brute force data structures games greedy | Statement | B | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 827 | Jinx or Jackpot | brute force dp math probabilities | Statement | J | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 24449 | New Year Cake | brute force implementation | Statement | B | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 789 | BattleCows 2 | binary search brute force data structures greedy | Statement | H | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 730 | Cool Problem | bitmasks brute force divide and conquer dp math | Statement | D | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 14947 | 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 | |
| 6623 | 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 | |
| 19187 | String Rotation Game | brute force strings | Statement | A | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 500.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 44957 | DBMB and the Array | brute force math | Statement | A | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 534 | 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 | ||
| 322 | Fuzzy Concatenation (Easy Version) | binary search bitmasks brute force data structures greedy string suffix structures | Statement | E1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2000.0 | Tutorial | |
| 9624 | Another Problem about Beautiful Pairs | brute force math two pointers | Statement | B | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 24313 | Friendly Numbers | brute force math | Statement | A | Codeforces Round 1079 (Div. 2) {2197} | PROGRAMMING | 500.0 | ||
| 24850 | Specialty String | brute force greedy strings | Statement | C | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 6279 | Divisibility Game | brute force games greedy number theory | Statement | D | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 23839 | Passing the Ball | brute force | Statement | A | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 5337 | 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 | ||
| 239 | Simons and Diophantus Equation | bitmasks brute force data structures number theory | Statement | G | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 3250.0 | Tutorial | |
| 18831 | Simons and Making It Beautiful | brute force constructive algorithms | Statement | A | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 500.0 | Tutorial | |
| 3717 | Special Problem | *special brute force games | Statement | J | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1347 | RReeppeettiittiioonn | binary search brute force implementation math number theory | Statement | B | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1250.0 | 152930 | |
| 176 | EXPloration, EXPloitation, and Gain Some EXPerience! | bitmasks brute force dp greedy implementation | Statement | D | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 2750.0 | 152930 | |
| 17878 | The 67th XOR Problem | binary search bitmasks brute force trees | Statement | E | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 44033 | The 67th Integer Problem | brute force games implementation math | Statement | A | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 11153 | Grid L | brute force math number theory | Statement | A | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 500.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 233 | Statistics on Tree | binary search brute force dfs and similar divide and conquer graphs trees | Statement | G | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 3500.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 793 | String Cutting | binary search brute force greedy hashing string suffix structures strings | Statement | F | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 8618 | Exceptional Segments | bitmasks brute force math | Statement | D | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 17864 | Alternating String | brute force greedy | Statement | B | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 14739 | 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 | ||
| 8339 | Cirno and Number (Easy Version) | binary search brute force dp implementation | Statement | C1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 18983 | Slimes on a Line | brute force greedy math | Statement | A | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 3644 | Goods on the Shelf | brute force data structures two pointers | Statement | D | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 9829 | Cost of a Bracket Sequence | brute force dp greedy | Statement | C | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 23477 | AI Project Development | brute force math | Statement | A | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | 154371 | ||
| 440 | Criterion in Burlandia | brute force data structures implementation | Statement | G | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 21689 | Omsk Programmers | brute force greedy math | Statement | C | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | 154496 | ||
| 15235 | Annoying the Ghost | brute force greedy | Statement | B | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) {2237} | PROGRAMMING | 1000.0 | Order Capital Round 2 (Codeforces Round 1104, Div. 1 + Div. 2) Editorial |