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 |
|---|---|---|---|---|---|---|
| 2081 | Codeforces Round 1010 (Div. 1, Unrated) | FINISHED | False | 10800 | 1956290 | March 15, 2025, 2:35 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 34 ) | E | Quantifier | PROGRAMMING | combinatorics dp implementation |
B''... |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 310770842 | StarSilk | E | March 15, 2025, 5:08 p.m. | OK | C++20 (GCC 13-64) | TESTS | 32 | 1249 | 702976000 | ||
| 310801311 | Sparkle_Twilight | E | March 15, 2025, 9:43 p.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 32 | 1186 | 702976000 | ||
| 310783858 | jatking | E | March 15, 2025, 6:47 p.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 32 | 1218 | 702976000 |
Back to search problems