Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1149 | Guard Duty (medium) | binary search dp greedy sortings | Statement | E2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2300 | |
| 10435 | Complex Market Analysis | binary search dp implementation number theory schedules two pointers | Statement | C | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 1500.0 | Deltix Round, Autumn 2021. Editorial | 1400 |
| 5351 | Are You a Procrastinator? | binary search schedules | Statement | D | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 7662 | Refined Product Optimality | binary search data structures greedy implementation math schedules sortings | Statement | D | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1750.0 | Good Bye 2024: 2025 is NEAR Editorial |