Submit  All submissions  Best solutions  Back to list 
XYZ_SORT  Sorting points 
Wersja polska  English version 
Write a program which will sort points and write it in descending order.
Input
The first line of the standard input contains one integer t (t<1000) which is the number of points to sort.
In each of the next t lines there are numbers x, y and z (x,y,z<1001) which are x, y and z coordinates of ith point in spherical coordinate system.
Output
For each test, print list of sorted in descending order points.
Example
Input
6
3 2 2
2 1 3
2 3 1
1 3 2
3 1 2
1 3 1
Output: 1 3 1
1 3 2
2 1 3
2 3 1
3 1 2
3 2 2
Added by:  Piotr Kąkol 
Date:  20100211 
Time limit:  1.406s 
Source limit:  1000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: SCM qobi 
hide comments


20130907 20:05:44 Piotr KÄ…kol
Good job Dominique! 1e7th submission. You beat me. ;) 

20110104 16:05:53 Piotr KÄ…kol
t limit added. Thanks. 

20110104 15:29:01 Hallvard Norheim Bø
What is the limit on t? 

20100803 11:03:18 Piotr KÄ…kol
In: 9
Out: 1 105 709
Last edit: 20100803 11:03:36 

20100803 10:04:20 intellectual
could u plz look at sol 3883799...can u tell me for which test case it is giving WA 

20100622 11:11:31 Piotr KÄ…kol
Tests are correct. For this test: 2
the correct answer is: 466 743 356


20100619 20:55:38 intellectual
is the problem fixed.i am still getting wrong ans.plz look into it. 

20100509 15:35:04 Piotr KÄ…kol
Fixed and rejudged: BINCLOCK, DDATE2, FIBON, GREGCAL, PASCAL_T,NEXTPERM and ROMANCAL. Thank You numerix for Your program  it was about 3 times faster to use it than using mine. :) 

20100509 12:38:01 Piotr KÄ…kol
I remember. I'll do rejudge after correcting them so You don't have to worry. ;) 

20100508 14:12:19 numerix
Let me remind you of the problemsets given below, that have still bad EOL. 