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 |
|---|---|---|---|---|---|---|---|---|---|
| 1669 | Beard Graph | data structures ds trees | Statement | D | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | 2200 | ||
| 325 | Alien DNA | data structures ds trees | Statement | E | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | 2700 | ||
| 5699 | Vessels | data structures ds implementation trees | Statement | D | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1900 | |
| 14216 | Lomsat gelral | data structures dfs and similar ds trees | Statement | E | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2300 | |
| 1159 | Acyclic Organic Compounds | data structures dfs and similar ds hashing strings trees | Statement | D | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | Codeforces Round #333 — editorial | 2400 | |
| 1247 | Pastoral Oddities | data structures divide and conquer ds math trees | Statement | E | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | 2900 | ||
| 7958 | Minimum spanning tree for each edge | data structures dfs and similar ds graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
| 602 | Clockwork Bomb | data structures dfs and similar ds greedy trees | Statement | E | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 3100 | ||
| 559 | ...Wait for it... | data structures ds trees | Statement | E | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | 2900 | ||
| 1127 | Drivers Dissatisfaction | data structures ds graphs trees | Statement | F | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | 2500 | ||
| 2526 | Imbalance Value of a Tree | data structures ds graphs trees | Statement | F | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 190 | Iqea | data structures dfs and similar divide and conquer ds shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 183 | Visible Black Areas | data structures ds geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 5809 | Dominant Indices | data structures ds trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 1316 | Leaf Sets | data structures dfs and similar ds graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 567 | Daleks' Invasion (hard) | data structures ds graphs trees | Statement | E3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2500 | |
| 595 | Forced Online Queries Problem | data structures divide and conquer ds graphs trees | Statement | F | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 4047 | Segment Tree | data structures ds graphs trees | Statement | D | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2100 |