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 |
|---|---|---|---|---|---|---|---|---|---|
| 3634 | Sausage Maximization | bitmasks data structures trees | Statement | E | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 2100 | |
| 5704 | New Year Tree | bitmasks data structures trees | Statement | E | Educational Codeforces Round 6 {620} | PROGRAMMING | Editorial of Educational Codeforces Round 6 | 2100 | |
| 3030 | Mahmoud and a xor trip | bitmasks constructive algorithms data structures dfs and similar dp math trees | Statement | E | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | 2200 | ||
| 2948 | Choosing The Commander | bitmasks data structures trees | Statement | E | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2100 | |
| 4575 | Danil and a Part-time Job | bitmasks data structures trees | Statement | E | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 2000 | ||
| 1516 | Palindromes in a Tree | bitmasks data structures divide and conquer trees | Statement | E | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | 2400 |