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 | ||
| 459 | LCM | *special implementation math | Statement | C | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 2879 | Maximize Sum of Digits | *special implementation math | Statement | B | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1700 |