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 |
---|---|---|---|---|---|---|---|---|---|
694 | Cinema | brute force data structures | Statement | A | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | 2600 | ||
1489 | Summer Homework | brute force data structures | Statement | E1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1500 | |
2244 | Subset Sums | brute force data structures | Statement | C | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2600 | |
1971 | Anton and Permutation | brute force data structures | Statement | E | Codeforces Round 404 (Div. 2) {785} | PROGRAMMING | 2300 | ||
2707 | Machine Learning | brute force data structures | Statement | F | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2600 |