joseplus问题

问题重述：设有n个人围坐在一个圆桌周围，现从第s个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列……求出列次序。

思路：用数组存储，数组长度为n+1.第0个不用。每数到一个人，将它的值移动到最后，然后将这个人之后的没有出列的人向前移动一位。直到只剩下一个人。

#include <stdio.h>
#include <malloc.h>

int main(int argc, char **argv)
{
    int        n, m, s;    // n: the whole people
                        // m: the length to select a people
                        // s: begin from 
    int        s1;            // s1:current point people
    int        *p;            // p: point to array
    int        i, j;
    int        tmp;
    printf("Input n, m and s:\n");
    scanf("%d %d %d", &n, &m, &s);
    p = (int *)malloc((n + 1) * sizeof(int));
    
    //init
    s1 = s;
    for (i = 1;i <= n; i++){
        p[i] = i;
    }

    for (i = n; i >= 1; i--){
        s1 = (s1 + m - 1) % i;
        if (0 == s1){
            s1 = i;
        }
        tmp = p[s1];
        for (j = s1; j <= i - 1; j++ ){
            p[j] = p[j+1];
        }
        p[i] = tmp;
    }
    
    for (i = 1; i <= n / 2; i++){
        tmp = p[i];
        p[i] = p[n-i+1];
        p[n-i+1] = tmp;
    }

    //print the result
    printf("The people order is:\n");
    for(i = 1;i <= n;i++){
        printf("%d\t",p[i]);
    }
    printf("\n");

    return 0;
}