pku2469.cpp

来自「这是ACM 方面的资料 是PKU的 北京大学的出来的」· C++ 代码 · 共 99 行

#include <stdio.h>

int change[110][53], now[53], next[53];

void init()
{
	int i;
	for (i = 0; i < 52; i++)
	{
		now[i] = i;
	}
}

void OutK(int k)
{
	int a, b;
	a = k / 13;
	b = k % 13;
	if (b < 9)
	{
		printf("%d", b + 2);
	}
	else if (b == 9)
	{
		printf("Jack");
	}
	else if (b == 10)
	{
		printf("Queen");
	}
	else if (b == 11)
	{
		printf("King");
	}
	else
	{
		printf("Ace");
	}
	printf(" of ");
	
	if (a == 0)
	{
		printf("Clubs");
	}
	else if (a == 1)
	{
		printf("Diamonds");
	}
	else if (a == 2)
	{
		printf("Hearts");
	}
	else
	{
		printf("Spades");
	}
	printf("\n");
}

void Out()
{
	int i;
	for (i = 0; i < 52; i++)
	{
		OutK(now[i]);
	}
	printf("\n");
}

int main()
{
	int i, t, n, j, k;
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < 52; j++)
		{
			scanf("%d", &change[i][j]);
			change[i][j]--;
		}
	}
	init();
	while (scanf("%d", &k) != -1)
	{
		k--;
		for (i = 0; i < 52; i++)
		{
			next[i] = now[change[k][i]];
		}
		for (i = 0; i < 52; i++)
		{
			now[i] = next[i];
		}
		Out();
	}
	return 0;
}