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 |
|---|---|---|---|---|---|---|---|---|---|
| 651 | Olha and Igor | interactive trees | Statement | F | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 3000.0 | Codeforces Round #682 (Div. 2) Editorial | |
| 119 | Centroid Guess | interactive probabilities trees | Statement | G | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 3500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 321 | Roads in E City | interactive math probabilities trees | Statement | E | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 2750.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 567 | Michael and Hotel | interactive trees | Statement | D | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 151 | Tree Diameter | interactive trees | Statement | H | Hello 2024 {1919} | PROGRAMMING | 5000.0 | 3500 |