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 |
|---|---|---|---|---|---|---|---|---|---|
| 4824 | Clique Problem | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2100 | |
| 9592 | Game of Credit Cards | data structures dp greedy sortings | Statement | B | Codeforces Round 401 (Div. 2) {777} | PROGRAMMING | 1300 | ||
| 1248 | Mice and Holes | data structures dp greedy sortings | Statement | F | Educational Codeforces Round 19 {797} | PROGRAMMING | 51588 | 2600 | |
| 2888 | Antenna Coverage | data structures dp greedy sortings | Statement | E | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2200 | |
| 3142 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 |