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 arr[30];
int ans[30];
int main()
{
int n;
int i;
int cnt=0;
int from=0;
//freopen("input.txt","r",stdin);
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&arr[i]);
while(cnt<n)
{
while(ans[from]!=0)
{
from=(from+1)%n;
}
ans[from]=arr[cnt];
cnt++;
from=(ans[from]+from)%n;
}
printf("%d\n",n);
for(i=0;i<n;i++) printf("%d ",ans[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... |