阿巴阿巴111111

                    解题思路:阿巴阿巴

注意事项:a[j]倒序

参考代码:

                    #include<stdio.h> 

                    #include<stdlib.h>

                    int main()

                    {

                     int *p;

                     int i,j,m,n;

                     scanf("%d", &n);

                     p = (int *)malloc(sizeof(int) *n);

                     if(p == NULL)

                     {

                     exit(1);

                     }

                     for(i = 0 ;i<n;i++)

                     {

                     scanf("%d", &p[i]);

                     }

                     scanf("%d",&m);

                     for(j=n-m;j<=n-1;j++)

                     {

                     printf("%d ",p[j]);

                     }

                     for(i = 0 ;i < n-m ; i++)

                     {

                     printf("%d ",p[i]);

                     }

                    /* for(i = 0 ;i<n;i++)

                     {

                     printf("%d ",p[i]);

                     }*/

                     free(p);

                     return 0;

                    }