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 |
|---|---|---|---|---|---|---|---|---|---|
| 7886 | Path Prefixes | binary search data structures dfs and similar implementation trees | Statement | G | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 1057 | Tree Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 2750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 2402 | Chain Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2000.0 | editorial_zh.pdf | 2100 |