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 |
|---|---|---|---|---|---|---|---|---|---|
| 27138 | Little Girl and Maximum Sum | data structures greedy implementation sortings | Statement | C | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1600 | |
| 4803 | Clique Problem | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2100 | |
| 7002 | Order Book | data structures greedy implementation sortings | Statement | B | Codeforces Round 317 [AimFund Thanks-Round] (Div. 2) {572} | PROGRAMMING | 1400 | ||
| 2375 | TV Shows | data structures greedy implementation sortings | Statement | D | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2000 | |
| 3101 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 |