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 |
|---|---|---|---|---|---|---|---|---|---|
| 119 | Sleeping | combinatorics implementation math | Statement | E | Codeforces Beta Round 86 (Div. 1 Only) {113} | PROGRAMMING | 2600 | ||
| 4238 | Tourist Problem | combinatorics implementation math | Statement | C | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1700 | |
| 2330 | Lengthening Sticks | combinatorics implementation math | Statement | A | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 2300 | |
| 9684 | Minimum number of steps | combinatorics greedy implementation math | Statement | B | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 1400 | |
| 29304 | K-th Beautiful String | combinatorics implementation math | Statement | B | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1300 |