| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 40152053 | Jul/10/2018 01:09 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 483 ms | 9900 KB |
| 40152040 | Jul/10/2018 01:08 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 732 ms | 4400 KB |
| 40152018 | Jul/10/2018 01:06 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 327 ms | 1300 KB |
| 40152008 | Jul/10/2018 01:06 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 2792 ms | 156100 KB |
| 40151981 | Jul/10/2018 01:03 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 373 ms | 10800 KB |
| 40151953 | Jul/10/2018 01:01 | Test.code | E1 - Median on Segments (Permutations Edition) | C++14 (GCC 6-32) | Accepted | 124 ms | 9900 KB |
| 40151936 | Jul/10/2018 00:59 | Test.code | F - Berland and the Shortest Paths | C++14 (GCC 6-32) | Accepted | 655 ms | 31200 KB |
| 40151900 | Jul/10/2018 00:57 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Wrong answer on test 14 | 78 ms | 8400 KB |
| 40151860 | Jul/10/2018 00:55 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Wrong answer on test 15 | 390 ms | 4900 KB |
| 40151836 | Jul/10/2018 00:53 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Wrong answer on test 21 | 265 ms | 2100 KB |
| 40151823 | Jul/10/2018 00:52 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 2495 ms | 124600 KB |
| 40151808 | Jul/10/2018 00:51 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 716 ms | 53700 KB |
| 40151786 | Jul/10/2018 00:49 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 436 ms | 3900 KB |
| 40151763 | Jul/10/2018 00:48 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 2573 ms | 151400 KB |
| 40151749 | Jul/10/2018 00:46 | Test.code | A - Tanya and Stairways | C++14 (GCC 6-32) | Accepted | 31 ms | 300 KB |
| 40151734 | Jul/10/2018 00:45 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 62 ms | 700 KB |
| 40151702 | Jul/10/2018 00:43 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 31 ms | 1900 KB |
| 40151692 | Jul/10/2018 00:43 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 78 ms | 700 KB |
| 40151516 | Jul/10/2018 00:26 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 31 ms | 700 KB |
| 40151511 | Jul/10/2018 00:25 | Test.code | B - Delete from the Left | Python 3 | Accepted | 249 ms | 900 KB |
| 40151508 | Jul/10/2018 00:25 | Test.code | B - Delete from the Left | Python 2 | Runtime error on test 1 | 155 ms | 0 KB |
| 40151484 | Jul/10/2018 00:23 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 78 ms | 700 KB |
| 40151479 | Jul/10/2018 00:23 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 78 ms | 900 KB |
| 40151469 | Jul/10/2018 00:22 | Test.code | B - Delete from the Left | Java 8 | Accepted | 171 ms | 0 KB |
| 40151450 | Jul/10/2018 00:21 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 280 ms | 1900 KB |
| 40151441 | Jul/10/2018 00:20 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 2323 ms | 146700 KB |
| 40151425 | Jul/10/2018 00:19 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 280 ms | 1400 KB |
| 40151419 | Jul/10/2018 00:19 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 108 ms | 135400 KB |
| 40151410 | Jul/10/2018 00:18 | Test.code | C - Summarize to the Power of Two | C++14 (GCC 6-32) | Accepted | 296 ms | 4400 KB |
| 40151391 | Jul/10/2018 00:17 | Test.code | D - Polycarp and Div 3 | C++14 (GCC 6-32) | Accepted | 46 ms | 1800 KB |
| 40151380 | Jul/10/2018 00:16 | Test.code | D - Polycarp and Div 3 | Java 8 | Accepted | 140 ms | 0 KB |
| 40151362 | Jul/10/2018 00:15 | Test.code | F - Berland and the Shortest Paths | C++14 (GCC 6-32) | Accepted | 264 ms | 21400 KB |
| 40151330 | Jul/10/2018 00:12 | Test.code | A - Tanya and Stairways | C++14 (GCC 6-32) | Wrong answer on test 9 | 15 ms | 0 KB |
| 40151320 | Jul/10/2018 00:12 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 78 ms | 800 KB |
| 40151305 | Jul/10/2018 00:11 | Test.code | A - Tanya and Stairways | C++14 (GCC 6-32) | Accepted | 30 ms | 0 KB |
| 40151296 | Jul/10/2018 00:11 | Test.code | B - Delete from the Left | C++14 (GCC 6-32) | Accepted | 78 ms | 700 KB |
| 40146500 | Jul/09/2018 20:51 | Test.code | A - Tanya and Stairways | C++14 (GCC 6-32) | Hacked | 15 ms | 0 KB |
| 40146375 | Jul/09/2018 20:48 | Test.code | F - Berland and the Shortest Paths | C++14 (GCC 6-32) | Accepted | 265 ms | 21300 KB |
| 40145983 | Jul/09/2018 20:41 | Test.code | E1 - Median on Segments (Permutations Edition) | C++14 (GCC 6-32) | Accepted | 140 ms | 11400 KB |
| 40145852 | Jul/09/2018 20:39 | Test.code | F - Berland and the Shortest Paths | C++14 (GCC 6-32) | Accepted | 780 ms | 28700 KB |

| Name |
|---|


