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 |
---|---|---|---|---|---|---|---|---|---|
132 | Help King | implementation probabilities trees | Statement | B | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2600 | ||
4224 | Game on Tree | implementation math probabilities trees | Statement | C | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2400 | |
4396 | Guess Your Way Out! | implementation math trees | Statement | C | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 1700 | |
16499 | Christmas Spruce | implementation trees | Statement | B | Hello 2018 {913} | PROGRAMMING | Tutorial | 1200 | |
5608 | Useful Decomposition | implementation trees | Statement | C | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1400 |