Unknown Language Round 1

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
64 Unknown Language Round 1 FINISHED False 9000 478101623 Feb. 21, 2011, 4 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 298 ) D Presents PROGRAMMING *special greedy 1900

You are given the prices of three presents. Also there are three sisters. It is known that the most valuable present is for the eldest sister. The second (by price) is for the second sister. And the less valuable present is for the youngest sister. If two (or three) presents have the same price, corresponding sisters may get the in a random way. The only line contains three integer numbers a 1 , a 2 , a 3 ( 1 ≤ a 1 , a 2 , a 3 ≤ 100 ) — the prices of the presents. Print three numbers i 1 , i 2 , i 3 ( 1 ≤ i 1 , i 2 , i 3 ≤ 3 ), all of them should be distinct. The first number stands for the seniority of the sister which will get the first present (1 stands for the eldest, 3 for the youngest). The second and third numbers mean the seniority of the sisters which get the second and the third present respectively. If there are multiple answers, print any of them. In the second sample another possible answer is "2 3 1".

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
294425 osa_k D Feb. 21, 2011, 4:49 p.m. OK Tcl TESTS 51 30 2355200 1900
3134768 misterku D Feb. 15, 2013, 9:46 p.m. OK Tcl TESTS 51 31 0 1900
3818128 yermak0v D June 3, 2013, 9:19 a.m. OK Tcl TESTS 51 46 0 1900
3669358 Omelianenko D May 4, 2013, 1:41 p.m. OK Tcl TESTS 51 46 0 1900
823386 tec D Nov. 1, 2011, 4:15 p.m. OK Tcl TESTS 51 50 2355200 1900
732113 shinian D Sept. 30, 2011, 6 p.m. OK Tcl TESTS 51 50 2355200 1900
668157 ZhouYuChen D Sept. 4, 2011, 5:17 p.m. OK Tcl TESTS 51 50 2355200 1900
639985 Ksu_PomorSU D Aug. 27, 2011, 12:31 p.m. OK Tcl TESTS 51 50 2355200 1900
614499 Dunaril D Aug. 18, 2011, 3:55 p.m. OK Tcl TESTS 51 50 2355200 1900
601217 antonkudrin D Aug. 9, 2011, 11:58 p.m. OK Tcl TESTS 51 50 2355200 1900

remove filters

Back to search problems