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 |
|---|---|---|---|---|---|---|---|---|---|
| 344 | Roland and Rose | brute force geometry math sortings | Statement | E | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 2700 | |
| 4527 | Vanya and Triangles | brute force combinatorics data structures geometry math sortings | Statement | D | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1900 | |
| 1923 | Leaving the Bar | brute force data structures geometry greedy math sortings | Statement | C | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2200 |