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 |
|---|---|---|---|---|---|---|---|---|---|
| 376 | Appleman and Complicated Task | ds math | Statement | D | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2700 | |
| 333 | Cycle sort | ds math | Statement | E | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 3100 | |
| 20922 | Books Exchange (easy version) | ds math | Statement | B1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1000 | |
| 13670 | Palindromic Paths | ds greedy math | Statement | C | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial |