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 |
|---|---|---|---|---|---|---|
| 2052 | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) | FINISHED | False | 18000 | 2845485 | Dec. 15, 2024, 7:35 a.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 21 ) | C | Cactus without Bridges | PROGRAMMING | constructive algorithms math |
B''... |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 296563326 | dXqwq orzdevinwang jqdai0815 | C | Dec. 15, 2024, 12:09 p.m. | OK | C++20 (GCC 13-64) | TESTS | 84 | 624 | 54886400 |
Back to search problems