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 |
|---|---|---|---|---|---|---|---|---|---|
| 1798 | Inversions problem | brute force dfs and similar dp meet-in-the-middle | Statement | G1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 2073 | Field expansion | brute force dp meet-in-the-middle | Statement | D | Playrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2) {799} | PROGRAMMING | Playrix Codescapes Cup Problems Analysis | 2000 |