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 |
|---|---|---|---|---|---|---|---|---|---|
| 2481 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 3767 | Three Logos | bitmasks brute force constructive algorithms geometry implementation math | Statement | D | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1700 | |
| 1301 | Anton and School | bitmasks constructive algorithms implementation math | Statement | F | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 2600 | |
| 3232 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial |