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 |
|---|---|---|---|---|---|---|---|---|---|
| 1561 | Permutation | data structures divide and conquer hashing | Statement | F | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2600 | |
| 4196 | Kostya the Sculptor | data structures hashing | Statement | D | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 1600 | |
| 1855 | The Untended Antiquity | data structures hashing | Statement | E | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | 2300 | ||
| 1870 | Ann and Books | data structures flows hashing | Statement | F | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 2500 | ||
| 739 | Vicky's Delivery Service | data structures ds graphs hashing | Statement | F | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2800 | |
| 2098 | Stack Exterminable Arrays | data structures divide and conquer dp hashing | Statement | F | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2600 |