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 |
|---|---|---|---|---|---|---|---|---|---|
| 615 | Rectangular Polyline | constructive algorithms dp geometry | Statement | D | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 2000.0 | Codeforces Round #680 Editorial | |
| 17788 | Ian Visits Mary | constructive algorithms geometry | Statement | A | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 800 |