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 |
|---|---|---|---|---|---|---|---|---|---|
| 1885 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp ds greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 570 | Tree Queries | binary search data structures dp ds geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 2832 | Qpwoeirut and Vertices | binary search data structures ds trees | Statement | E | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 2250.0 | Codeforces Round #809 Editorial | |
| 546 | Smooth Sailing (Hard Version) | binary search data structures ds graphs trees | Statement | F2 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) |