Sicily 1003. Hit or Miss

循环队列的模拟。需要注意的是，每个人是轮流进行游戏的，而非同时行动，下一个玩家必须等上一个玩家完毕后（match与否皆可）才进行游戏。另外，判断不可赢的条件要注意下，原则上是所有玩家剩余牌数的最小公倍数，方便起见我直接设为13 * 52（没什么来由的）了。

Run Time: 0sec

Run Memory: 312KB

Code length: 1719Bytes

Submit Time: 2011-10-20 19:43:50

// Problem#: 1003
// Submission#: 908756
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
#include <queue>
#include <cstring>
using namespace std;

int main()
{
    int t, T;
    int i, n;
    int card, unchanged, discard;

    cin >> T;
    for ( t = 1; t <= T; t++ ) {
        queue<int> qi[ 11 ];
        int count[ 11 ];
        int last[ 11 ];

        cin >> n;
        for ( i = 1; i <= 52; i++ ) {
            cin >> card;
            qi[ 1 ].push( card );
        }
        for ( i = 1; i <= n; i++ )
            count[ i ] = 1;

        unchanged = 0;
        discard = 0;
        while ( discard != 52 ) {
            for ( i = 1; i <= n; i++ ) {
                if ( !qi[ i ].empty() ) {
                    card = qi[ i ].front();
                    qi[ i ].pop();
                    if ( card == count[ i ] ) {
                        unchanged = -1;
                        if ( qi[ i ].empty() )
                            last[ i ] = card;
                        if ( i != n )
                            qi[ i + 1 ].push( card );
                        else
                            discard++;
                    }
                    else
                        qi[ i ].push( card );

                    count[ i ]++;
                    if ( count[ i ] == 14 )
                        count[ i ] = 1;
                }
            }

            unchanged++;
            if ( unchanged == 13 * 52 )
                break;
        }

        cout << "Case " << t << ":";
        if ( discard == 52 ) {
            for ( i = 1; i <= n; i++ )
                cout << " " << last[ i ];
            cout << endl;
        }
        else
            cout << " unwinnable\n";
    }

    return 0;

}