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 |
---|---|---|---|---|---|---|---|---|---|
9015 | Letters Cyclic Shift | constructive algorithms greedy implementation strings | Statement | A | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 1200 | |
8676 | Long Beautiful Integer | constructive algorithms greedy implementation strings | Statement | A | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 1700 |