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 |
|---|---|---|---|---|---|---|---|---|---|
| 306 | Winning Strategy | binary search graphs math shortest paths | Statement | C | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | 2300 | ||
| 4804 | Planets | binary search data structures graphs shortest paths | Statement | B | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | 1900 | ||
| 2417 | Yaroslav and Time | binary search graphs shortest paths | Statement | B | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | 2000 | ||
| 2957 | Complete The Graph | binary search constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | 2200 | ||
| 1507 | Arson In Berland Forest | binary search graphs graphs shortest paths | Statement | E | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2200 |