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 |
|---|---|---|---|---|---|---|---|---|---|
| 12155 | Jellyfish and Green Apple | bitmasks greedy math number theory | Statement | C | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 1000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 6856 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial |