DeepSeek给的用vector的tj

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

int main() {
    int n, m;
    cin >> n >> m;

    vector<int> monkeys;
    for (int i = 1; i <= n; ++i)
        monkeys.push_back(i);

    int current_pos = 0;
    while (monkeys.size() > 1) {
        int p = (current_pos + m - 1) % monkeys.size();
        monkeys.erase(monkeys.begin() + p);
        current_pos = p % monkeys.size();
    }

    cout << monkeys[0] << endl;
    return 0;
}