int main()
{
int n, m, i, p;
int *arr = NULL;
scanf("%d %d", &n, &m);
//printf("%d %d", n, m);
arr = creat_arr(n);
if (NULL ==arr)
{
printf ("arr created err!\n");
return 0;
}
//printf("size:%d", sizeof(arr));
//printf("before m:%d",m);
//m=n-m%n;
if (n < 1 || n > 100)
{
return 0;
}
else if (m >= n)
{
int i = 1;
do
{
p = m - n*i;
i++;
}while(p >= n );
m = p;
}
//printf("after m%d",p);
for (i = 0; i < n; i++)
{
scanf("%d",arr+i);
}
if (n == 1)
{
printf("%d", arr[0]);
return 0;
}
for (i = n-m; i < n; i++)
{
printf("%d ",arr[i]);
}
for (i = 0; i < n-m-1; i++)
{
printf("%d ",arr[i]);
}
printf("%d",arr[n-m-1]);
if (NULL != arr)
{
free(arr);
arr = NULL;
}
return 0;
}
int main()
{
int m,n,i;
int num=0;
printf("input row and col:");
scanf("%d %d",&m,&n);
int **arr=(int**)malloc(sizeof(int*)*m);
for(i=0;i<m;i++)
{
arr[i]=(int *)malloc(sizeof(int)*n);
}
printf("input arr num:\n");
creat_arr(arr,m,n);
printMatrix(arr,m,n);
return 0;
}
