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 |
---|---|---|---|---|---|---|---|---|---|
2589 | Moodular Arithmetic | combinatorics dfs and similar ds math number theory | Statement | B | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | Codeforces Round #334 Editorial | 2000 |