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 |
|---|---|---|---|---|---|---|---|---|---|
| 72 | Egg Roulette | bitmasks brute force divide and conquer math meet-in-the-middle | Statement | F | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 3300 | ||
| 7566 | Maximum Subsequence | bitmasks divide and conquer meet-in-the-middle | Statement | E | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1800 |