669 |
Proof |
L - All-Pair Farthest Points |
Runtime error |
C++ |
0.000 |
2011-10-01 19:26:31 |
668 |
Roman Andreev |
L - All-Pair Farthest Points |
Wrong answer |
C++ |
1.228 |
2011-10-01 19:26:19 |
667 |
Radi Muhammad Reza |
D - Composite Transformations |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 19:24:56 |
666 |
Proof |
L - All-Pair Farthest Points |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 19:11:49 |
665 |
Orfest |
H - Smallest Enclosing Rectangle |
Accepted |
C++ |
0.432 |
2011-10-01 19:11:26 |
664 |
Proof |
L - All-Pair Farthest Points |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 19:09:26 |
663 |
Orfest |
H - Smallest Enclosing Rectangle |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 19:09:04 |
662 |
Pavel Simo |
A - Smallest Regular Polygon |
Accepted |
C++ |
0.016 |
2011-10-01 19:05:48 |
661 |
Proof |
L - All-Pair Farthest Points |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 19:03:44 |
660 |
Roman Andreev |
L - All-Pair Farthest Points |
Wrong answer |
C++ |
1.296 |
2011-10-01 19:01:22 |
659 |
Pedro Victor |
A - Smallest Regular Polygon |
Accepted |
C++ |
0.008 |
2011-10-01 19:01:02 |
658 |
Proof |
L - All-Pair Farthest Points |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 19:00:59 |
657 |
Proof |
L - All-Pair Farthest Points |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 18:58:23 |
656 |
daizhenyang |
E - 2D Geometry 110 in 1! |
Accepted |
C++ |
0.012 |
2011-10-01 18:56:18 |
655 |
Proof |
L - All-Pair Farthest Points |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 18:55:31 |
654 |
Pavel Simo |
A - Smallest Regular Polygon |
Wrong answer |
C++ |
0.008 |
2011-10-01 18:38:29 |
653 |
Orfest |
H - Smallest Enclosing Rectangle |
Runtime error |
C++ |
0.000 |
2011-10-01 18:37:19 |
652 |
daizhenyang |
E - 2D Geometry 110 in 1! |
Accepted |
C++ |
0.012 |
2011-10-01 18:35:23 |
651 |
Orfest |
H - Smallest Enclosing Rectangle |
Runtime error |
C++ |
0.000 |
2011-10-01 18:31:13 |
650 |
Proof |
L - All-Pair Farthest Points |
Runtime error |
C++ |
0.000 |
2011-10-01 18:30:32 |
649 |
Orfest |
H - Smallest Enclosing Rectangle |
Runtime error |
C++ |
0.000 |
2011-10-01 18:28:42 |
648 |
Proof |
L - All-Pair Farthest Points |
Runtime error |
C++ |
0.000 |
2011-10-01 18:28:41 |
647 |
Roman Andreev |
L - All-Pair Farthest Points |
Wrong answer |
C++ |
1.920 |
2011-10-01 18:26:07 |
646 |
Roman Andreev |
L - All-Pair Farthest Points |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 18:24:21 |
645 |
daizhenyang |
E - 2D Geometry 110 in 1! |
Accepted |
C++ |
0.012 |
2011-10-01 18:23:25 |
644 |
Proof |
L - All-Pair Farthest Points |
Runtime error |
C++ |
0.000 |
2011-10-01 18:21:30 |
643 |
Sakib Md. Bin Malek |
A - Smallest Regular Polygon |
Wrong answer |
C++ |
0.008 |
2011-10-01 18:20:54 |
642 |
daizhenyang |
E - 2D Geometry 110 in 1! |
Accepted |
C++ |
0.012 |
2011-10-01 18:20:47 |
641 |
Orfest |
H - Smallest Enclosing Rectangle |
Time limit exceeded |
C++ |
2.000 |
2011-10-01 18:19:27 |
640 |
Pavel Simo |
A - Smallest Regular Polygon |
Wrong answer |
C++ |
0.008 |
2011-10-01 18:15:08 |