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 |
|---|---|---|---|---|---|---|---|---|---|
| 80 | Chain Letter | *special dfs and similar graphs | Statement | D | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2300 | ||
| 75 | Graph Decomposition | *special graphs | Statement | G | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 41 | Unusual Graph | *special graphs | Statement | I | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 383 | Magic Tricks | *special dp graphs | Statement | E | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1700 |