缘起:普及练习场-线性数据结构-约瑟夫问题
先上代码
#include<cstdio>
#include<iostream>
using namespace std;
int data[101];//数据
int n,m;
int index;
int count=0;
int main(){
//cout<<"TEST: "<<10%9<<endl;
cin>>n>>m;
for(int i=0;i<n;i++){
data[i]=i;
}
index=1;
for(int i=0;i<n;i++){
//cout<<"TEST:"<<i<<endl;
for(int j=index;true;j++){
if(j>n){
//cout<<"I:"<<i<<",N:"<<n<<endl;
index=j-n;
//cout<<"index:"<<index<<endl;
//count=0;
i--;
break;
}
int number=data[j];
if(number==-1){
continue;
}
//cout<<"TEST:"<<i<<","<<count<<endl;
count++;
//cout<<"count:"<<count<<",i:"<<j<<endl;
if(cou