ACM学习历程—HDU 1276 士兵队列训练问题(队列)

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <stack>
#include <map>
#include <queue>
#include <string>
#include <algorithm>
#define LL long long

using namespace std;

int n;

void work()
{
    queue<int> q[2];
    bool now = 0;
    int num;

    for (int i = 1; i <= n; ++i)
        q[now].push(i);

    for (;;)
    {
        if (q[now].size() <= 3)
            break;
        num = 0;
        now = !now;
        while (!q[!now].empty())
        {
            num = num%2+1;
            if (num != 2)
                q[now].push(q[!now].front());
            q[!now].pop();
        }

        if (q[now].size() <= 3)
            break;
        num = 0;
        now = !now;
        while (!q[!now].empty())
        {
            num = num%3+1;
            if (num != 3)
                q[now].push(q[!now].front());
            q[!now].pop();
        }
    }
    bool flag = false;
    while (!q[now].empty())
    {
        if (flag)
            printf(" ");
        printf("%d", q[now].front());
        q[now].pop();
        flag = true;
    }
    printf("\n");
}

int main()
{
    //freopen("test.in", "r", stdin);
    int T;
    scanf("%d", &T);
    for (int times = 0; times < T; ++times)
    {
        scanf("%d", &n);
        work();
    }
    return 0;
}