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 |
|---|---|---|---|---|---|---|---|---|---|
| 2926 | Double Profiles | graphs hashing sortings | Statement | C | Codeforces Round 109 (Div. 1) {154} | PROGRAMMING | 2300 | ||
| 1248 | Hydra | graphs sortings | Statement | B | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | 2100 | ||
| 1806 | Sereja and the Arrangement of Numbers | graphs greedy sortings | Statement | C | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2200 | |
| 14117 | The Child and Toy | graphs greedy sortings | Statement | C | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1600 |