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 |
|---|---|---|---|---|---|---|---|---|---|
| 569 | Gnikool Ssalg | *special implementation strings | Statement | B | Unknown Language Round 4 {130} | PROGRAMMING | Unknown Language Round #4: editorial | 1500 | |
| 3105 | Command Line Arguments | *special implementation strings | Statement | B | Чемпионат КРОК 2013 - Квалификационный раунд {291} | PROGRAMMING | 2000 | ||
| 1028 | Hostname Aliases | *special binary search data structures implementation sortings strings | Statement | C | Чемпионат КРОК 2016 - Квалификация {644} | PROGRAMMING | 2300 | ||
| 1403 | Stepan and Vowels | *special implementation strings | Statement | K | VK Cup 2017 - Уайлд-кард раунд 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1600 | |
| 836 | Minus and Minus Give Plus | *special implementation strings | Statement | C | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 153 | kotlinkotlinkotlinkotlin... | *special graphs implementation strings | Statement | F | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2400 |