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 |
---|---|---|---|---|---|---|---|---|---|
1438 | PermuTree (hard version) | bitmasks dp implementation trees | Statement | E2 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial |