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 |
|---|---|---|---|---|---|---|
| 2027 | Codeforces Round 982 (Div. 2) | FINISHED | False | 7200 | 1869899 | Oct. 26, 2024, 2:35 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 4547 ) | D1 | The Endspeaker (Easy Version) | PROGRAMMING | binary search dp graphs greedy implementation two pointers |
B''... |
No solutions yet.