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 |
|---|---|---|---|---|---|---|---|---|---|
| 991 | Guard Towers | binary search ds geometry graphs sortings | Statement | E | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | 2600 | ||
| 1158 | Summer Earnings | binary search bitmasks brute force geometry sortings | Statement | E | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2400 | |
| 271 | Looking for Owls | binary search data structures geometry hashing sortings | Statement | D | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2600 | |
| 165 | Little Brother | binary search geometry sortings | Statement | E | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | 2700 | ||
| 665 | Large Triangle | binary search geometry sortings | Statement | D | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2700 |