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 |
|---|---|---|---|---|---|---|---|---|---|
| 3012 | Clear Symmetry | constructive algorithms dp math | Statement | A | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | Разбор задач | 1700 | |
| 779 | Maxim and Matrix | constructive algorithms dp math | Statement | C | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2300 | |
| 8064 | Permutation | constructive algorithms dp math | Statement | B | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | 1400 | ||
| 6630 | Cards | constructive algorithms dp math | Statement | B | 8VC Venture Cup 2016 - Elimination Round {626} | PROGRAMMING | 23522 | 1300 | |
| 393 | Tournament Construction | constructive algorithms dp graphs greedy math | Statement | D | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2700 |