UVa 10935 (水题) Throwing cards away I

直接用STL里的queue模拟即可。

#include <cstdio>
#include <queue>
using namespace std;

const int maxn = 60;
int discarded[maxn], cnt;

int main()
{
    int n;
    while(scanf("%d", &n) == 1 && n)
    {
        cnt = 0;
        queue<int> Q;
        for(int i = 1; i <= n; i++) Q.push(i);
        while(Q.size() >= 2)
        {
            discarded[cnt++] = Q.front(); Q.pop();
            int t = Q.front(); Q.pop(); Q.push(t);
        }
        printf("Discarded cards:");
        for(int i = 0; i < cnt; i++)
        {
            if(i) printf(",");
            printf(" %d", discarded[i]);
        }
        printf("\n");
        printf("Remaining card: %d\n", Q.front());
    }

    return 0;
}