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 |
|---|---|---|---|---|---|---|---|---|---|
| 1751 | Old Berland Language | data structures greedy trees | Statement | C | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 1900 | |
| 1853 | Big Maximum Sum | data structures dp greedy implementation math trees | Statement | D | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | 2100 | ||
| 610 | Clockwork Bomb | data structures dfs and similar ds greedy trees | Statement | E | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 3100 | ||
| 3455 | Centroids | data structures dfs and similar dp graphs greedy trees | Statement | C | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 2500 | |
| 7014 | Okabe and Boxes | data structures greedy trees | Statement | C | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 1600 | |
| 4358 | Perfect Security | data structures greedy strings trees | Statement | C | VK Cup 2018 - Round 1 {923} | PROGRAMMING | 1900 | ||
| 684 | Maximum Control (medium) | data structures dfs and similar graphs greedy trees | Statement | B2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | 2400 | ||
| 1548 | Short Code | data structures dp greedy strings trees | Statement | E | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 2500 | |
| 1960 | The Number Games | data structures greedy trees | Statement | E | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2300 | |
| 1339 | Leaf Sets | data structures dfs and similar ds graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 3766 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 |