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
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1097 | Zebra Tower | *special data structures greedy sortings | Statement | E | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2100 | |
| 2125 | Running with Obstacles | *special data structures dp greedy | Statement | D | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 2000 | ||
| 127 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 252 | Dune II: Battle For Arrakis | *special data structures greedy math | Statement | F | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2000 | |
| 135 | Painting Numbers | *special data structures greedy number theory | Statement | G | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 285 | Chess Team Forming | *special binary search data structures greedy | Statement | E | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 131 | Good Subarray | *special data structures greedy | Statement | F | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial | ||
| 154 | 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 |