[백준 1158] 요세푸스 문제 (Queue) (C/C++)

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <vector>
#include <queue>
using namespace std;
 
int N, K;
queue<int> q;
 
int main(void)
{
//    freopen("B1158_input.txt", "r", stdin);
    
    cin >> N >> K;
    
    for(int i = 1; i <= N; i++)
    {
        q.push(i);
    }
    
    cout << "<";
    while(!q.empty())
    {
        if(q.size() == 1)
        {
            cout << q.front() << ">";
            q.pop();
            
            break;
        }
        
        int cnt = 1;
        
        while(cnt != K)
        {
            int temp = q.front();
            q.pop();
            q.push(temp);
            
            cnt++;    
        }
        
        if(cnt == K)
        {
            cout << q.front() << ", ";
            q.pop();
        }
    }
    
    return 0;
}