题解 | 约瑟夫环

#include <iostream>
#include <vector>
using namespace std;

int main() {
   int n,k,m;
   cin >> n >> k >> m;
   vector<int>arr(1000,1);
   int current = k;
   int count = n;
   int cnt = 0;
   while(count>=1){
    if(arr[current]!=0){
      cnt++;
      if(cnt==m){
        arr[current]=0;
        count--;
        cnt = 0;
      }
    }
    if(current == n){
        current = 1;
    }else{
        current++;
    }
   } 
   cout << current-1 <<endl;
}