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 |
|---|---|---|---|---|---|---|---|---|---|
| 1209 | Password | bitmasks dp shortest paths | Statement | D | Codeforces Beta Round 71 {79} | PROGRAMMING | 2700 | ||
| 571 | Circling Round Treasures | bitmasks shortest paths | Statement | C | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | 2600 | ||
| 813 | Logical Expression | bitmasks dp shortest paths | Statement | E | Hello 2018 {913} | PROGRAMMING | Tutorial | 2400 | |
| 2521 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 6820 | Shortest Cycle | bitmasks brute force graphs shortest paths | Statement | B | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1900 |