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 |
|---|---|---|---|---|---|---|---|---|---|
| 4082 | Dasha and Very Difficult Problem | binary search brute force constructive algorithms greedy sortings | Statement | D | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | 1700 | ||
| 7291 | Office Keys | binary search brute force dp greedy sortings | Statement | A | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | 1900 | ||
| 4833 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | 1800 | ||
| 835 | Curfew | binary search brute force greedy sortings | Statement | D | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 2400 |