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 |
|---|---|---|---|---|---|---|---|---|---|
| 78045 | Vanya and Lanterns | binary search implementation math sortings | Statement | B | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1200 | |
| 3190 | Vanya and Computer Game | binary search implementation math sortings | Statement | D | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1800 | |
| 1017 | New Year and the Acquaintance Estimation | binary search data structures graphs greedy implementation math sortings | Statement | E | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2400 |