Shuffling Machine

题目贴在最后。
解析：1.第一步读懂题，英语太渣，自己就在网上多看些解析或源码
2.看别人代码，原理理解，自己手写。有点惨，忽略很多细节，导致编译或提交失败多次，如for循环嵌套时，第二个for条件j打成i，导致报数组越界异常，后来调试多次才发现；再如最后输出时，减一是否必要，自己的算式到底如何，要学会理解

 #include<cstdio>

/*洗牌程序
	首先牌初始化，按顺序排放。
	洗牌方法:给定54个1-54不同数字，比如第一个数字为23，则洗牌后，第一张牌放到23位，类推。

*/
const int N=55;
char ch[5] = {'S','H','C','D','J' };
int start[55], then[55], mov[55];
int main() {
	int k;					//洗牌次数
	scanf("%d", &k);
	for (int i = 1; i < N; i++) {		//初始化
		start[i] = i;
	}
	for (int i = 1; i < N; i++) {		//给定洗牌数字
		scanf("%d", &mov[i]);
	}
	for (int i = 0; i < k; i++) {
		for (int j = 1; j < N; j++) {
			then[mov[j]] = start[j];
		}
		for (int j = 1; j < N; j++) {
			start[j] = then[j];
		}
	}
	for (int i = 1; i <= 54; i++) {
		if (i - 1) printf(" ");     //控制输出格式
		printf("%c%d", ch[(start[i]-1) / 13], (start[i] - 1) % 13 + 1); //输出：花色+所属花色下的编号 (start[i]-1) % 13+1。
	//若为start[i]%13,则26直接取余为0；若为ch[start[i]/ 13],则13从S变为H
	}

	return 0;
}

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