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 |
|---|---|---|---|---|---|---|---|---|---|
| 8346 | Ladder | dp implementation two pointers | Statement | C | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | 1700 | ||
| 12721 | DZY Loves Sequences | dp implementation two pointers | Statement | A | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1700 | |
| 11058 | Approximating a Constant Range | dp implementation two pointers | Statement | B | Codeforces Round 333 (Div. 2) {602} | PROGRAMMING | 1400 | ||
| 16608 | Air Conditioner | dp greedy implementation sortings two pointers | Statement | C | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1500.0 | Codeforces Round #620 (Div. 2) Editorial | 1500 |