UVA 10205 Stack 'em Up

　　 直接模拟就好。

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
const char* kind[] = {"Clubs","Diamonds","Hearts","Spades"};
const char* num[] = {"Jack","Queen","King","Ace"};
char tmp[];
int ord[][],N;
int cards[],ct[];
int main()
{
    //freopen("sample.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d",&N);
        for (int i = ; i <= N; i++)
            for (int j = ; j <= ; j++)
            scanf("%d",&ord[i][j]);
        for (int i = ; i <= ; i++) cards[i] = i;
        getchar();
        while (gets(tmp) && tmp[]!='\0')
        {
            int x ;
            sscanf(tmp,"%d",&x);
            for (int i = ; i <= ; i++) ct[i] = cards[ord[x][i]];
            memcpy(cards,ct,sizeof(cards));
        }
        for (int i = ; i <= ; i++)
        {
            int t = (cards[i] - ) % ;
            if (t < ) printf("%d",t + );
            else printf ("%s",num[t % ]);
            printf(" of ");
            printf("%s\n",kind[(cards[i] - ) / ]);
        }
        if (T) putchar('\n');
    }
    return ;
}