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 |
|---|---|---|---|---|---|---|---|---|---|
| 15066 | Cyclic Permutations | combinatorics graphs math | Statement | C | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 1250.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 21426 | Ball in Berland | combinatorics dfs and similar graphs hashing math | Statement | C | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 12878 | Little Alawn's Puzzle | combinatorics dfs and similar dp ds graphs math | Statement | C | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 1400 | Dominoes | combinatorics fft graphs math | Statement | D | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) |