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 |
|---|---|---|---|---|---|---|---|---|---|
| 15662 | Lucky Numbers (easy) | binary search bitmasks brute force | Statement | B | Codeforces Beta Round 77 (Div. 2 Only) {96} | PROGRAMMING | Codeforces Beta Round #77 (Div. 2 Only) Question A - D | 1400 | |
| 7478 | The Number Of Good Substrings | binary search bitmasks brute force | Statement | C | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 |