#include
#define N 10
void reverse(int *b) //逆序排列函数
{
int i, t;
for(i = 0; i <= N/2 - 1; i++)
{
t = b[i];
b[i] = b[N-1-i];
b[N-1-i] = t;
}
}
int main()
{
int i;
int a[N] = {9,8,7,4,5,1,2,0,3,6};
reverse(a);
for(i = 0; i < N; i++)
{
printf("%d ",a[i]);
}
printf("\n");
return 0;
}
void inverse(int a[],n)
{
int i,t;
for(i=0;i<=n/2;i++)
t=a[i];
a[i]=a[n-1-i];
a[n-1-i]=t;
}
main()
{
int a[5],i;
for(i=0;i<5;i++)
scanf("%d",&a[i]);
inverse(a,5);
for(i=0;i<5;i++)
printf("%d,",a[i]);
}