uva 130 – roman roulette

#define N 101

bool live[N];
inline int (int now, int n);
int main()
{
    int n, k;
    while (scanf("%d%d", &n, &k) && n)
    {
        int start, i, pos;

        for (start = 1; start <= n; start++)
        {
            for (i = 0; i <= n; i++)
                live[i] = true;

            int now = start;
            bool flag = true;
            pos = 1;

            for (i = 1; i < n&&flag; i++)
            {
                int count = k;
                while (count)
                {
                    count--;
                    if (!count)
                    {
                        int temp = now;
                        
                        live[now] = false;

                        if (now == pos)
                        {
                            flag = false;
                            break;
                        }

                        //找人去埋，並換去剛殺的位子
                        for (int j = 0; j < k; j++)
                            temp = getNext(temp, n);

                        //如果有移動到Josephus 
                        if (temp == pos)
                            pos = now;
                        
                        live[now] = true;
                        live[temp] = false;
                    }

                    now = getNext(now, n);
                }
            }

            //Josephus還活著
            if (live[pos])
                break;
        }

        printf("%dn", start);
    }

    return 0;
}
int (int now, int n)
{
    do
    {
        now++;
        if (now > n)
            now = 1;
    } while (!live[now]);

    return now;
}