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 |
|---|---|---|---|---|---|---|
| 2254 | Codeforces Round 1114 (Div. 3) | FINISHED | False | 8100 | 55509 | Aug. 4, 2026, 2:35 p.m. |
Solved |
Index |
Name |
Type |
Tags |
Rating |
|---|---|---|---|---|---|
| ( 24763 ) | A | Riptide | PROGRAMMING | implementation sortings | |
| ( 17856 ) | B | Evanescent | PROGRAMMING | implementation strings two pointers | |
| ( 13659 ) | C1 | Marenol (easy version) | PROGRAMMING | greedy | |
| ( 9479 ) | C2 | Marenol (hard version) | PROGRAMMING | greedy sortings | |
| ( 7100 ) | D | Silhouette | PROGRAMMING | constructive algorithms math sortings | |
| ( 4064 ) | E | Chronostasis | PROGRAMMING | binary search data structures greedy | |
| ( 1305 ) | F | Whiplash | PROGRAMMING | bitmasks constructive algorithms math | |
| ( 331 ) | G | Nightcrawler | PROGRAMMING | data structures dfs and similar dp greedy sortings trees |
No solutions yet.