https://www.luogu.org/problemnew/show/P1996
/*
*@Author: STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
typedef __int128 lll;
const int N=10000;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int main()
{
#ifdef DEBUG
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
scanf("%d%d",&n,&m);
bool visit[200]={0};
for(int k=0;k<n;k++){
for(int i=0;i<m;i++){
if(++q>n)q=1;
if(visit[q])i--;
}
printf("%d ",q);
visit[q]=true;
}
//cout << "Hello world!" << endl;
return 0;
}
详解：
https://blog.csdn.net/tingyun_say/article/details/52343897
https://blog.csdn.net/wusuopubupt/article/details/18214999
扩展：
京公网安备 11010502036488号