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 |
|---|---|---|---|---|---|---|---|---|---|
| 12032 | Searching Local Minimum | binary search interactive ternary search | Statement | A | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #700 | |
| 1472 | Joking (Easy Version) | binary search bitmasks constructive algorithms interactive ternary search | Statement | E1 | Codeforces Global Round 23 {1746} | PROGRAMMING | 2000.0 | Codeforces Global Round 23 Editorial | |
| 11238 | Ruler (easy version) | binary search interactive ternary search | Statement | G1 | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | |||
| 8266 | Ruler (hard version) | binary search interactive ternary search | Statement | G2 | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING |