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 |
|---|---|---|---|---|---|---|---|---|---|
| 471 | Half-decay tree | data structures divide and conquer dp math probabilities | Statement | D | Codeforces Beta Round 62 {68} | PROGRAMMING | 2400 | ||
| 643 | Smart Cheater | data structures math probabilities | Statement | C | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | 2300 | ||
| 618 | Memory and Casinos | data structures math probabilities | Statement | E | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | 2700 | ||
| 3747 | Beautiful Mirrors | data structures dp math probabilities | Statement | E | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 2100 | |
| 611 | LCC | data structures math matrices probabilities | Statement | D | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 |