模拟:
STL队列:
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
#define inf 0x3f3f3f3f
#define LL unsigned long long
#include<queue>
using namespace std;
int n,m;
queue<int> q;
/******Program Begin*********/
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)q.push(i);
int cnt=0;
while(!q.empty())
{
int t = q.front();
q.pop();
cnt++;
if(cnt%m==0)
{
cnt=0;
printf("%d ",t);
continue;
}
else q.push(t);
}
return 0;
}
/*******Program End**********/
#include"stdio.h"
int main()
{
int m,n,i,j;
int s=1;
int a[30005];
scanf("%d%d",&n,&m);
for(i=0;i<=n;