题解 | 约瑟夫环

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

int main() {
   int n,k,m;
   cin >> n >> k >> m;
   vector<int>arr;//标记是否kill
   for(int i = 0; i < n; i++){
        arr.push_back(i);
    }
   int current = k%n;
   while(arr.size()>1){
     current = (current + m - 1) % arr.size();
      arr.erase(arr.begin() + current);
   }
   cout << arr[0];
}