题目来源:码蹄集
https://matiji.net/exam/brushquestion/19/3181/1DC60EA6DF83A333301CFFE1407FBA59
参考程序:
#include<bits/stdc++.h>
#define maxn 25
using namespace std;
int n,k,m;
int a[maxn];
int solve(int p,int d,int t){
while(t--){
do{
p=(p+d+n-1)%n+1;
}
while(a[p]==0);
}
return p;
}
int main()
{
while(scanf("%d%d%d",&n,&k,&m)==3&&n){
for(int i=1;i<=n;i++){
a[i]=n;
}
int left=n;
int p1=n;
int p2=1;
while(left){
p1=solve(p1,1,k);
p2=solve(p2,-1,m);
printf("%3d",p1);
left--;
if(p2!=p1){
printf("%3d",p2);
left--;
}
a[p1]=a[p2]=0;
if(left)printf(",");
}
printf("\n");
}
return 0;
}