Problem I

Statement
Copy Copied
Description:
Sorting arrays is traditionally associated with high-level languages. How hard can it be in Befunge? Sort the given array in non-descending order.

Input Format:
The first line of input contains an integer n (1 ≤ n ≤ 100) — 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 Format:
Output space-separated elements of the sorted array.

Note:
None

Evaluations

Eval IDRun IDProviderModelLangSuccessTimestampPromptResponseStdoutStderrRetry
4188 20260326-230008 gemini gemini-3.1-pro-preview go true 2026-03-27T01:49:10.522537Z View View View View Retry
4148 20260326-230008 gemini gemini-3.1-pro-preview go true 2026-03-27T00:39:54.262579Z View View View View Retry