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 |
|---|---|---|---|---|---|---|---|---|---|
| 689 | Castle | dp greedy probabilities sortings trees | Statement | D | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | 2300 | ||
| 640 | Bear and Destroying Subtrees | dp math probabilities trees | Statement | E | VK Cup 2016 - Round 3 {643} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 2600 | |
| 1052 | Third Month Insanity | dp probabilities trees | Statement | D | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | 2100 |