Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 2028 | Codeforces Round 986 (Div. 2) | FINISHED | False | 7200 | 570299 | Nov. 10, 2024, 3:35 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 2059 ) | D | Alice's Adventures in Cards | PROGRAMMING | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths |
No solutions yet.