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 |
|---|---|---|---|---|---|---|---|---|---|
| 484 | Half-decay tree | data structures divide and conquer dp math probabilities | Statement | D | Codeforces Beta Round 62 {68} | PROGRAMMING | 2400 | ||
| 3870 | Beautiful Mirrors | data structures dp math probabilities | Statement | E | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 2100 |