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 |
|---|---|---|---|---|---|---|---|---|---|
| 912 | Brain Network (hard) | trees | Statement | C3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2200 | |
| 52 | Tree of Life (hard) | trees | Statement | F3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 3200 | |
| 494 | In a Trap | trees | Statement | E | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 3200 | |
| 528 | Rowena Ravenclaw's Diadem | trees | Statement | D | Manthan, Codefest 17 {855} | PROGRAMMING | 2400 | ||
| 8445 | Add on a Tree | trees | Statement | A1 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 1600 |