1158번: 조세퍼스 문제

#include <iostream>

#include <list>

using namespace std;

int main()

{

list<int> josep, answer;

int n, m;

cin >> n >> m;

for (int i = 1; i < n + 1; ++i)

josep.push_back(i);

cout << "<";

for (int i = 0; i < n; ++i)

{

for (int j = 1; j < m; ++j)

{

josep.push_back(josep.front());

josep.pop_front();

}

cout << (josep.front()) << ((i == (n - 1)) ? ">" : ", ");

josep.pop_front();

}

}