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 |
|---|---|---|---|---|---|---|---|---|---|
| 27197 | Hexadecimal's theorem | brute force constructive algorithms implementation number theory | Statement | A | Codeforces Round 125 (Div. 2) {199} | PROGRAMMING | Solutions for Codeforces Round #125 | 1000 | |
| 3985 | Devu and Partitioning of the Array | brute force constructive algorithms implementation number theory | Statement | C | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1700 |