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 |
|---|---|---|---|---|---|---|---|---|---|
| 342 | Table | *special greedy implementation math | Statement | C | Unknown Language Round 1 {64} | PROGRAMMING | 1700 | ||
| 188 | Goshtasp, Vishtasp and Eidi | *special greedy math | Statement | A | Unknown Language Round 2 {72} | PROGRAMMING | 1900 | ||
| 121 | Oil | *special greedy math | Statement | F | Unknown Language Round 2 {72} | PROGRAMMING | 2100 | ||
| 65 | Interval Coloring | *special greedy math | Statement | J | Unknown Language Round 3 {100} | PROGRAMMING | 2400 | ||
| 233 | Teams | *special binary search greedy math | Statement | D | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 232 | Dune II: Battle For Arrakis | *special data structures greedy math | Statement | F | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2000 |