约瑟夫环

2019-03-05 15-38-04 的屏幕截图.png

#include <iostream>
#include <cmath>

using namespace std;

int main(){
    int n,k,m,count=0,i,j=0;
    cin>>n>>k>>m;
    int *p= new int[n]();
    i=k;
    while(true){
        j=(j+1)%m;
        do{
            i=(i+1)%n;
        }while(p[i]!=0);
        if(j==m-1){
            p[i]=++count;
            if(count==n)break;
        }
    }
    cout<<i<<endl;
    return 0;
}