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 |
|---|---|---|---|---|---|---|
| 45 | School Team Contest 3 (Winter Computer School 2010/11) | FINISHED | False | 18000 | 442177199 | Nov. 13, 2010, 11 a.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 193 ) | H | Road Problem | PROGRAMMING | graphs | 2600 |
B''... |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 194186 | tourist | H | Nov. 13, 2010, 2:25 p.m. | OK | Delphi | TESTS | 50 | 50 | 43212800 | 2600 | |
| 193535 | zpl1 chensqi plokzfadai | H | Nov. 13, 2010, 1:31 p.m. | OK | GNU C | TESTS | 50 | 60 | 8294400 | 2600 |
Back to search problems