A1042. Shuffling Machine (20)

Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid "inside jobs" where employees collaborate with gamblers by performing inadequate shuffles, many casinos employ automatic shuffling machines. Your task is to simulate a shuffling machine.

The machine shuffles a deck of 54 cards according to a given random order and repeats for a given number of times. It is assumed that the initial status of a card deck is in the following order:S1, S2, ..., S13, H1, H2, ..., H13, C1, C2, ..., C13, D1, D2, ..., D13, J1, J2

where "S" stands for "Spade", "H" for "Heart", "C" for "Club", "D" for "Diamond", and "J" for "Joker". A given order is a permutation of distinct integers in [1, 54]. If the number at the i-th position is j, it means to move the card from position i to position j. For example, suppose we only have 5 cards: S3, H5, C1, D13 and J2. Given a shuffling order {4, 2, 5, 3, 1}, the result will be: J2, H5, D13, S3, C1. If we are to repeat the shuffling again, the result will be: C1, H5, S3, J2, D13.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer K (<= 20) which is the number of repeat times. Then the next line contains the given order. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the shuffling results in one line. All the cards are separated by a space, and there must be no extra space at the end of the line.

Sample Input:

2
36 52 37 38 3 39 40 53 54 41 11 12 13 42 43 44 2 4 23 24 25 26 27 6 7 8 48 49 50 51 9 10 14 15 16 5 17 18 19 1 20 21 22 28 29 30 31 32 33 34 35 45 46 47

Sample Output:

S7 C11 C10 C12 S1 H7 H8 H9 D8 D9 S11 S12 S13 D10 D11 D12 S3 S4 S6 S10 H1 H2 C13 D2 D3 D4 H6 H3 D13 J1 J2 C1 C2 C3 C4 D1 S5 H5 H11 H12 C6 C7 C8 C9 S2 S8 S9 H10 D5 D6 D7 H4 H13 C5

题目大意：

制作一个洗牌机的程序，将牌打乱，输入两行数据，第一行为打乱次数，第二行为打乱规则，一共54个数字，  如果在第i位的值为j，就意味着移动这张卡片从i到j。    

定义三组数组，一组存放打乱规则，一组存放初始数值， 一组存放打乱后的数值。

通过（x-1）/13确定花色， 因为s13若直接除13为1。 之后先将花色依次存入数组sy中，再借助 sy[（x-1）/13 ] 输出花色。

通过（x-1）%13 + 1确定数字，因为直接对13取余，可能会出现0，所以先减去1，之后再加1。 多考虑边界范围；

代码如下：

#include <cstdio>

const int max_n = 60;

int main()
{
	int K, pos;
	int start[max_n], end[max_n], next[max_n];
	char sy[5] = {'S', 'H', 'C', 'D', 'J'};        //存入花色，注意大小写
	scanf ("%d", &K);
	
	for (int i =1; i <= 54; i++)
	{
		scanf ("%d", &pos);
		next[i] = pos;		//存储规则； 
		start[i] = i;		//初始化数字； 
	}
	
	while (K--)
	{
		for (int i =1; i <= 54; i++)
		{
			end [next[i]] = start [i];    
		}
		
		for (int i =1; i <= 54; i++)
		{
			start [i] = end [i];        //将结果赋值给初始数组， 以供下一次循环使用；
		}
	}
	
	for (int i = 1; i <= 54; i++)
	{	
		end[i]--;
		printf ("%c%d", sy[end[i] / 13], end[i] % 13 + 1);  //注意边界范围； 
		if (i != 54)
			printf (" ");            
	}
	
	return 0;
}