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 |
|---|---|---|---|---|---|---|---|---|---|
| 410 | Xenia and String Problem | dp hashing implementation string suffix structures strings | Statement | E | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 2800 | ||
| 687 | Digits of Number Pi | dp implementation strings | Statement | F | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | 3200 | ||
| 3493 | Reberland Linguistics | dp implementation strings | Statement | A | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | 1800 | ||
| 1905 | Three Religions | dp implementation strings | Statement | B | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2200 |