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 |
|---|---|---|---|---|---|---|---|---|---|
| 36841 | Random Teams | combinatorics constructive algorithms greedy math | Statement | B | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 1300 | |
| 7537 | Tennis Championship | combinatorics constructive algorithms greedy math | Statement | C | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 1700 | |
| 9684 | Minimum number of steps | combinatorics greedy implementation math | Statement | B | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 1400 | |
| 12027 | Tiles | combinatorics greedy math | Statement | C | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 21306 | JOE is on TV! | combinatorics greedy math | Statement | B | Codeforces Round 614 (Div. 2) {1293} | PROGRAMMING | 750.0 | Codeforces Round #614 Editorial | 1000 |
| 15675 | Permutation Partitions | combinatorics greedy math | Statement | C | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1300 |