Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 30 | Draw Polygon Lines | *special constructive algorithms dp geometry interactive | Statement | A | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 416 | More Gifts | *special dfs and similar two pointers | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 112 | Big Persimmon | *special dp games | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 177 | Almost Certainly | *special constructive algorithms data structures sortings | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 106 | Parallel Universes | *special constructive algorithms dfs and similar dsu graphs | Statement | A | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 273 | Three Arrays | *special constructive algorithms implementation sortings | Statement | B | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 43 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 2592 | 1-3-5 | *special dp | Statement | A | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1100 | |
| 1196 | Clock in the Pool | *special math | Statement | B | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1400 | |
| 333 | Yet Another Permutation Constructive | *special constructive algorithms | Statement | E | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1900 | |
| 254 | Narrow Paths | *special combinatorics | Statement | F | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 2000 | |
| 93 | Composite Spells | *special dp | Statement | H | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 2600 | |
| 50 | Equal Trees | *special graphs meet-in-the-middle | Statement | I | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 3100 | |
| 24 | Stack and Queue | *special data structures divide and conquer | Statement | I | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 132 | Good Subarray | *special data structures greedy | Statement | F | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 58 | Strange Matrix | *special graphs greedy | Statement | H | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 184 | Rock-Paper-Scissors Bot | *special greedy strings | Statement | E | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 38 | Alice, Bob, And Two Arrays | *special data structures dp games | Statement | A | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 159 | Arithmetic Exercise | *special data structures dp greedy | Statement | B | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 699 | Cute Subsequences | *special sortings | Statement | D | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 47 | Order Statistics | *special binary search | Statement | D | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
| 46 | 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 | |||
| 489 | Coin Game | *special greedy | Statement | C | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 28 | Nim with Special Numbers | *special *special | Statement | H | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 27 | Hamiltonian Partition | *special *special | Statement | I | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 163 | Color the Arrows | *special *special dp dp | Statement | E | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 70 | Weapon Upgrade | *special *special dp dp | Statement | F | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 89 | Esports in Berland | *special *special greedy greedy | Statement | G | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 268 | Uppercase or Lowercase? | *special *special interactive | Statement | D | Kotlin Heroes: Episode 12 {2087} | PROGRAMMING | 141608 | ||
| 3761 | Would It Be Unrated? | *special brute force | Statement | C | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 641 | Mysterious Script | *special expression parsing | Statement | I | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 848 | Blurry Vision | *special fft math | Statement | H | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 6017 | Plinko | *special games interactive | Statement | B | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 5320 | Where Am I? | *special geometry | Statement | D | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 966 | Definitely a Geometry Problem | *special geometry | Statement | G | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 842 | ⅓ оf а Рrоblеm | *special math | Statement | F | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 788 | Pair Count | *special number theory | Statement | E | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 13846 | Piecing It Together | *special string suffix structures | Statement | A | April Fools Day Contest 2025 {2095} | PROGRAMMING | |||
| 351 | Minimum on Subarrays | *special brute force | Statement | C | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 64 | Good Robot Paths | *special data structures geometry sortings | Statement | G | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 85 | Merging Vertices in a Graph | *special dfs and similar dsu graphs | Statement | H | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 260 | Perfect Cut | *special dp greedy | Statement | E | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 1500 | Games | *special greedy | Statement | B | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 145 | Array Reduction | *special greedy | Statement | F | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 483 | Avoid Minimums | *special greedy math | Statement | D | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 1656 | Furniture Store | *special implementation | Statement | A | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 188 | Supersequence | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 97 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 160 | Self-Produced Sequences | *special combinatorics math | Statement | F | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 488 | Minesweeper | *special constructive algorithms greedy | Statement | C | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 1095 | Two Towers | *special greedy math | Statement | B | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 307 | Two Arrays | *special math | Statement | D | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 61 | Jammer | *special math | Statement | G | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 3624 | Special Problem | *special brute force games | Statement | J | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1091 | Shortest Paths | *special shortest paths | Statement | E | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial |