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 |
|---|---|---|---|---|---|---|---|---|---|
| 4341 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 5165 | Very Suspicious | binary search brute force geometry implementation math | Statement | D | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2250.0 | Tutorial | 1700 |
| 605 | Cute number | binary search brute force implementation math | Statement | D | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 17227 | Rudolf and Snowflakes (simple version) | binary search brute force implementation math | Statement | E1 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 7115 | Rudolf and Snowflakes (hard version) | binary search brute force implementation math | Statement | E2 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 10018 | Circle Perimeter | binary search brute force dfs and similar geometry implementation math | Statement | F | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1600 |