Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3794 | Puzzles | dfs and similar math probabilities trees | Statement | B | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 1800 | |
| 3340 | LuoTianyi and the Floating Islands (Hard Version) | combinatorics dfs and similar math probabilities trees | Statement | B2 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2300 |
| 1892 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 2656 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | Codeforces Round #992 (Div.2) Editorial |