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 |
|---|---|---|---|---|---|---|---|---|---|
| 4128 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 5714 | Omkar and Circle | brute force constructive algorithms dp games greedy | Statement | D | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2000.0 | Codeforces Round #655 Editorial | 2100 |
| 12891 | Stoned Game | brute force constructive algorithms games greedy | Statement | B | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 4715 | Tenzing and His Animal Friends | brute force constructive algorithms graphs greedy shortest paths | Statement | D | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1500.0 | CodeTON Round 5 Editorial |