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 |
|---|---|---|---|---|---|---|---|---|---|
| 10453 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 19814 | Make it Alternating | combinatorics dp greedy | Statement | C | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 1300 | |
| 7920 | Magnitude (Hard Version) | combinatorics dp greedy | Statement | C2 | Codeforces Global Round 26 {1984} | PROGRAMMING | 1250.0 | Codeforces Global Round 26 Editorial | |
| 11405 | Beautiful Sequence | combinatorics dp greedy | Statement | C | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING |