1158 조세퍼스 문제

#include <iostream>

#include <queue>

using namespace std;

int main(void) {

queue<int> q;

int N, M;

cin >> N >> M;

for (int i = 1; i <= N; i++) {

q.push(i);

}

cout << "<";

for (int i = 0; i < N-1; i++) {

for (int j = 0; j < M-1; j++) {

int temp;

temp = q.front();

q.pop();

q.push(temp);

}

cout << q.front() << ", ";

q.pop();

}

cout << q.front() << ">" << endl;

return 0;

}