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 |
|---|---|---|---|---|---|---|---|---|---|
| 8117 | Booking System | binary search dp greedy implementation | Statement | C | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | 1600 | ||
| 384 | Pasha and Pipe | binary search brute force combinatorics dp implementation | Statement | F | Codeforces Round 293 (Div. 2) {518} | PROGRAMMING | Codeforces Round #293 (Div.2) Editorial | 2800 | |
| 607 | Vanya and Balloons | binary search brute force dp implementation | Statement | E | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | 2600 | ||
| 66384 | Interesting drink | binary search dp implementation | Statement | B | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1100 | |
| 2404 | Treasure Hunting | binary search dp greedy implementation | Statement | D | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2000 | |
| 1541 | Nanosoft | binary search data structures dp implementation | Statement | E | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2500 |