Surprise Language Round 7

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
470 Surprise Language Round 7 FINISHED False 7200 365783423 Sept. 13, 2014, 3:30 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 194 ) H Array Sorting PROGRAMMING *special 2600

Sorting arrays is traditionally associated with high-level languages. How hard can it be in FALSE? Sort the given array in non-descending order. The input consists of a single line of space-separated integers. The first number is n ( 1 ≤ n ≤ 10 ) — the size of the array. The following n numbers are the elements of the array ( 1 ≤ a i ≤ 100 ). Output space-separated elements of the sorted array.

Tutorials

Surprise Language Round #7: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
64784179 steven1029 H Nov. 13, 2019, 8:30 a.m. OK FALSE TESTS 24 15 0 2600
40987949 ReaLNero1 H July 30, 2018, 9:38 p.m. OK FALSE TESTS 24 15 0 2600
21770078 samvel.safaryan.s H Oct. 25, 2016, 11:51 a.m. OK FALSE TESTS 24 15 0 2600
19138274 DATASOURCE H July 15, 2016, 12:23 a.m. OK FALSE TESTS 24 15 0 2600
18516786 TooNewbie H June 16, 2016, 9:23 a.m. OK FALSE TESTS 24 15 0 2600
18507837 I_Need_Alex_R_Coleman H June 15, 2016, 10:31 p.m. OK FALSE TESTS 24 15 0 2600
15723975 cugel H Feb. 1, 2016, 4:06 a.m. OK FALSE TESTS 24 15 0 2600
14806321 zlobber H Dec. 14, 2015, 5:45 p.m. OK FALSE TESTS 24 15 0 2600
13925908 130705009 H Oct. 29, 2015, 3:04 a.m. OK FALSE TESTS 24 15 0 2600
11518068 rxdoi H June 10, 2015, 7:26 a.m. OK FALSE TESTS 24 15 0 2600

remove filters

Back to search problems