約瑟夫環(huán)問題

2022-07-14 17:12

2022-07-14 18:07
#include
int main(){
int ff[300],n,m,nn,i,j;
while(n!=0&&m!=0){
scanf("%d%d",&n,&m);
j=0;
for(i=0;i nn=n;
if(m!=1){
while(nn>1){
for(i=0;i if(ff[i]<0){continue;}
ff[i]=0;
j++;
ff[i]+=j;
if(ff[i]%m==0){
ff[i]=-1;
nn--;}
}
}
for(i=0;i if(ff[i]!=-1)printf("%d\n",i+1);}
}
else {printf("%d\n",n);} }
return 0; }
熱門問答