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 |
|---|---|---|---|---|---|---|---|---|---|
| 356 | Table | *special greedy implementation math | Statement | C | Unknown Language Round 1 {64} | PROGRAMMING | 1700 | ||
| 102651 | Taxi | *special greedy implementation | Statement | B | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1800 | |
| 2654 | Friends or Not | *special greedy implementation | Statement | A | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1700 | |
| 2557 | Прокат велосипедов | *special greedy implementation | Statement | A | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | Разбор VK Cup 2018 — Квалификация 2 | 1600 | |
| 127 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 294 | Shooting | *special greedy implementation | Statement | C | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING |