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 |
|---|---|---|---|---|---|---|---|---|---|
| 2047 | Big Maximum Sum | data structures dp greedy implementation math trees | Statement | D | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2) Editorial | 2100 | |
| 2444 | Serge and Dining Room | binary search data structures graph matchings greedy implementation math trees | Statement | C | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2400 | |
| 340 | Johnny and James | greedy implementation math trees | Statement | D | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2500.0 | Codeforces Round #647 Editorial | 2900 |
| 1918 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial |