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 |
|---|---|---|---|---|---|---|---|---|---|
| 1256 | Last Chance | data structures implementation strings | Statement | E | Codeforces Beta Round 98 (Div. 2) {137} | PROGRAMMING | Codeforces Beta Round #98 (Div. 2): Editorial | 2000 | |
| 2101 | Messenger | data structures hashing implementation string suffix structures strings | Statement | D | Codeforces Round 344 (Div. 2) {631} | PROGRAMMING | 2100 | ||
| 2818 | Spy Syndrome 2 | data structures dp hashing implementation sortings string suffix structures strings | Statement | C | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 1900 | |
| 2644 | Unstable String Sort | data structures dfs and similar ds graphs greedy implementation strings | Statement | F | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2400 |