Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2416 | Fibonacci army | *special dp | Statement | G | Unknown Language Round 2 {72} | PROGRAMMING | 1200 | ||
| 375 | Stepan's Series | *special dp | Statement | J | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 2100 | |
| 110 | Composing Of String | *special dp | Statement | I | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 2500 | ||
| 2574 | Chat | *special dp | Statement | B | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 1800 | ||
| 1014 | Tanya and Colored Candies | *special dp | Statement | C | Mail.Ru Cup 2018 - Practice Round {1057} | PROGRAMMING | 2300 | ||
| 43 | Good Subsets | *special dp | Statement | I | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 51 | Pac-Man 2.0 | *special dp | Statement | I | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2900 |