BAEKJOON 1158 - 조세퍼스 문제

문제: https://www.acmicpc.net/problem/1158

유명한 josephus 문제입니다. linked list 을 이용해 풀었습니다.

#pragma warning (disable:4996)
#include <cstdio>
#include <cstring>
#include <climits>
#include <algorithm>
#include <list>
 
using namespace std;
 
void josephus(int n, int m)
{
    list<int> survivors;
 
    for (int i = 1; i <= n; i++)
    {
        survivors.push_back(i);
    }
 
    list<int>::iterator dead = survivors.begin();
    for (int i = 0; i < m - 1; i++)
    {
        dead++;
    }
    printf("<");
    while (true)
    {
        printf("%d", *dead);
        dead = survivors.erase(dead);
        
        if (dead == survivors.end())
        {
            dead = survivors.begin();
        }
 
        n--;
 
        if (n == 0)
        {
            break;
        }
 
        printf(", ");
 
        for (int i = 0; i < (m - 1) % n; i++)
        {
            dead++;
            if (dead == survivors.end())
            {
                dead = survivors.begin();
            }
        }
    }
    printf(">");
}
 
int main()
{
    int n, m;
    scanf("%d %d", &n, &m);
 
    josephus(n, m);
 
    return 0;
}