蔡子经数据结构1.6

#define MAXN 100
int flag[MAXN];
int res[MAXN];
int top = 0;
int ()
{
    int n,i,k;
    scanf("%d %d %d",&n,&i,&k);
    for(int i = 1; i <= n; ++i) flag[i] = 1;
    int all = n;
    int cnt = 0;
    while(all)
    {
        while(cnt != k)
        {
            if(flag[i])
                ++cnt;
            ++i;
            if(i == n+1) i = 1;
        }
        cnt = 0;
        --all;
        if(i == 1) flag[n] = 0, res[top++] = n;
        else flag[i-1] = 0, res[top++] = i-1;
    }
    for(int i = 0; i < top; ++i)
        printf("%d ",res[i]);
    puts("");
    return 0;
}