PAT1008

PAT1008  最后一个测试点不过

#include <stdio.h>int main () {    int n,m;    int tmp;    int i,j,k;    scanf ("%d %d",&n,&m);    //printf ("the n is %d\n",n);    //printf ("the m is %d\n",m);    if ( n<1 || n> 100 ) {        return 1;    }    int item[n];    k=n;    //printf ("the k is %d\n",k);    for (i=0;i<n;i++) {        scanf ("%d", &item[i]);    }    if (m<0) return 1;    if (m>=n) {        m=m%n;    }    if (m!=0) {        for (i=0;i<m;i++) {            tmp=item[n-1-i];            j=(n-1-i+m)%n;            while ( n-1-i-m >= 0 ) {                item[n-1-i]=item[n-1-i-m];                n=n-m;            }            item[j]=tmp;            n=k;        }    }    for (i=0;i<k;i++) {        printf ("%d", item[i]);        if (i<k-1) printf ("*");    }    return 0;}