This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int main(void)
{
int NUM[50];
int res[50] = {0,};
int n;
scanf("%d", &n);
int i;
for(i = 0; i < n; i++)
scanf("%d", &NUM[i]);
int count = 0, from = 0, value;
while(count < n)
{
while(res[from] != 0)
{
from = (from+1)%n;
}
res[from] = NUM[count];
count++;
from = (res[from]+from) % n;
}
printf("%d\n", n);
for(i = 0; i < n; i++)
printf("%d ", res[i]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |