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 |
|---|---|---|---|---|---|---|---|---|---|
| 13117 | Bear and Prime 100 | constructive algorithms interactive math | Statement | A | Codeforces Round 356 (Div. 1) {679} | PROGRAMMING | 1400 | ||
| 7477 | Guess the Array | constructive algorithms interactive math | Statement | C | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1400 | |
| 1441 | Point Ordering | constructive algorithms geometry interactive math | Statement | C | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2300 | |
| 368 | Rin and The Unknown Flower | constructive algorithms greedy interactive math | Statement | E | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2250.0 | Codeforces Round #614 Editorial | 3500 |