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 |
|---|---|---|---|---|---|---|---|---|---|
| 623 | Brackets | combinatorics dp greedy | Statement | C | Codeforces Beta Round 92 (Div. 1 Only) {123} | PROGRAMMING | 2300 | ||
| 842 | The Red Button | combinatorics dfs and similar ds graphs greedy | Statement | E | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 2700 | |
| 3343 | Inna and Nine | combinatorics greedy | Statement | B | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 1600 | |
| 1753 | Order book | combinatorics data structures greedy | Statement | D | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2100 | |
| 14441 | Silent Classroom | combinatorics greedy | Statement | A | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 900 |