自测-5 Shuffling Machine

自测-5 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

算法思路：又是英文。。。好吧。题中洗牌机的原理是将一副牌按照指定序列调换位置数次，然后输出。（但是可以知道最终牌次序的洗牌？）

首先我们要建一副牌。C语言中的话要用二维数组来表示。而且要纯手打，十分麻烦。有没有简单一点的方法呢？

我们注意到，每一张牌是由花色和数字构成，每隔十三张花色变化。所以我们只要建一个花色的数组，然后用数字去判断花色。

我们还需要三个数组。一个用来保存初始的牌。一个用来保存调换次序。一个用来用来临时保存调换过程中的牌。

程序如下：

#include <stdio.h>

int main(){
	int n;
	scanf("%d", &n);
	
	char color[5] = {'S', 'H', 'C', 'D', 'J'};
	
	int card[54], order[54], temp[54];
	
	int i, j;
	for (i=0; i<54; i++){
		card[i] = i+1;
	}
	
	for (i = 0; i<54; i++){
		scanf("%d", &order[i]);
	}
	
	for (i=0; i<n; i++){
		for (j = 0; j<54; j++){
			temp[(order[j]-1)] = card[j];
		}
		for (j = 0; j< 54; j++){
			card[j] = temp[j];
		}
	}
	
	for (i=0; i<54; i++){
		printf("%c%d", color[(card[i]-1)/13], (card[i]-1)%13+1);
		if (i<53){
			printf(" ");
		}
	}
	return 0;
}