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 |
|---|---|---|---|---|---|---|---|---|---|
| 3897 | How many trees? | combinatorics divide and conquer dp | Statement | D | Codeforces Beta Round 9 (Div. 2 Only) {9} | PROGRAMMING | 2000 | ||
| 3148 | Vowels | combinatorics divide and conquer dp | Statement | E | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2700 | |
| 813 | Find a car | combinatorics divide and conquer dp | Statement | C | Codeforces Round 415 (Div. 1) {809} | PROGRAMMING | 2900 | ||
| 1953 | Palindrome-less Arrays | combinatorics divide and conquer dp | Statement | E | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2200 |