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 |
|---|---|---|---|---|---|---|---|---|---|
| 2634 | Beauty Pageant | brute force constructive algorithms greedy | Statement | C | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | 1600 | ||
| 786 | Kamal-ol-molk's Painting | brute force constructive algorithms greedy | Statement | C | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2100 | |
| 5828 | Beautiful Sequence | brute force constructive algorithms greedy | Statement | B | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1900 | |
| 13228 | Ehab and Prefix MEXs | brute force constructive algorithms greedy | Statement | C | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 1500.0 | Codeforces round #649 editorial | 1600 |