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 |
|---|---|---|---|---|---|---|---|---|---|
| 600 | Yet Another Number Sequence | combinatorics math matrices | Statement | C | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1500.0 | 83942 | |
| 2107 | PLEASE | combinatorics dp implementation math matrices | Statement | C | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | 2200 | ||
| 143 | Flowers and Chocolate | combinatorics math matrices | Statement | G | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 3200 | ||
| 956 | Lust | combinatorics math matrices | Statement | E | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2800 | |
| 3900 | Height All the Same | combinatorics constructive algorithms math matrices | Statement | E | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1750.0 | Codeforces Round #630 Editorial | 2100 |