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 |
---|---|---|---|---|---|---|---|---|---|
2646 | Dima and Two Sequences | combinatorics math sortings | Statement | D | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | 1800 | ||
2312 | Two Heaps | combinatorics constructive algorithms greedy implementation math sortings | Statement | B | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 1800 | ||
5834 | Makes And The Product | combinatorics implementation math sortings | Statement | B | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1500 | |
7059 | Leha and Function | combinatorics greedy math number theory sortings | Statement | A | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 1300 | |
1675 | Scalar Queries | combinatorics data structures math sortings | Statement | F | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2300 | |
1312 | New Year and Castle Construction | combinatorics geometry math sortings | Statement | E | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2500 |