Unknown Language Round 4

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
130 Unknown Language Round 4 FINISHED False 10800 410021999 Nov. 20, 2011, 3 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 167 ) I Array sorting PROGRAMMING *special sortings 2400

B'Sorting arrays is traditionally associated with high-level languages. How hard can it be in Befunge? Sort the given array in non-descending order. The first line of input contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- the size of the array. The following n lines contain the elements of the array, one per line. Each element of the array is an integer between 1 and 60, inclusive. The array might contain duplicate elements. Output space-separated elements of the sorted array.'...

Tutorials

Unknown Language Round #4: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
3816652 yermak0v I June 2, 2013, 6:16 p.m. OK Befunge TESTS 55 187 0 2400
3669381 Omelianenko I May 4, 2013, 1:45 p.m. OK Befunge TESTS 55 187 0 2400
3005561 romanychda I Jan. 24, 2013, 10:43 p.m. OK Befunge TESTS 55 187 0 2400
887901 fura2 I Nov. 23, 2011, 3:14 p.m. OK Befunge TESTS 55 200 4300800 2400
887262 zpl1 I Nov. 23, 2011, 10:05 a.m. OK Befunge TESTS 55 200 4300800 2400
887230 lenny I Nov. 23, 2011, 9:33 a.m. OK Befunge TESTS 55 200 4300800 2400
886313 uwi I Nov. 22, 2011, 5:41 p.m. OK Befunge TESTS 55 200 4300800 2400
885384 scottai1 I Nov. 22, 2011, 7:40 a.m. OK Befunge TESTS 55 200 4300800 2400
883826 AnBat I Nov. 21, 2011, 7:34 a.m. OK Befunge TESTS 55 200 4300800 2400
883280 knightL I Nov. 20, 2011, 10:18 p.m. OK Befunge TESTS 55 200 4300800 2400

remove filters

Back to search problems