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 |
|---|---|---|---|---|---|---|---|---|---|
| 13871 | Far Relative’s Birthday Cake | brute force combinatorics constructive algorithms implementation | Statement | A | Codeforces Round 343 (Div. 2) {629} | PROGRAMMING | Editorial of Codeforces Round #343 (Div.2) | 800 |