围圈报数

题面   http://ybt.ssoier.cn:8088/problem_show.php?pid=1334
 1 #include<iostream>
#include<cstdio>

using namespace std;

int n,m,head=1,tail,i,p,cnt;
int q[1001];
int main(){
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    q[i]=i;
    tail=n+1;
    while(head<tail)
    {
        p=q[head];
        cnt++;
        if(cnt!=m)
        {
            q[tail]=p;
            tail++;
        }
        else{
            cnt=0;
            printf("%d ",p);
        }
            head++;
        }
    return 0;
        
}