原题干：
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
题目大意：洗牌。原来的扑克牌顺序为
S1, S2, ..., S13, H1, H2, ..., H13, C1, C2, ..., C13, D1, D2, ..., D13, J1, J2
现在要求按照给定序列的顺序洗牌（例如原来的牌为{S1. S2, S3}，给定序列为{2，1，3}，意思就是原来S1移至第2个位置，原来S2移到第1个位置，以此类推。。。）
这里我们需要将数字转成扑克牌上的文字，你可以通过计算获得，例如第51个牌，先计算51/13判断数字部分，再计算51%13判断字母部分。
你也可以把所有牌写在代码里。如果往代码里写，可以写个小程序输出所有的牌，然后粘贴到代码里，会比较方便：
for(int i = 1; i <= 13; i++){
printf("\"%c%d\", ", 'S', i);
}
for(int i = 1; i <= 13; i++){
printf("\"%c%d\", ", 'H', i);
}
for(int i = 1; i <= 13; i++){
printf("\"%c%d\", ", 'C', i);
}
for(int i = 1; i <= 13; i++){
printf("\"%c%d\", ", 'D', i);
}
for(int i = 1; i <= 2; i++){
printf("\"%c%d\", ", 'J', i);
}运行输出结果直接粘贴到代码里就行。
代码如下：
#include <iostream>
#include <string>
using namespace std;
string map[] = {" ",
"S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "S10", "S11", "S12", "S13",
"H1", "H2", "H3", "H4", "H5", "H6", "H7", "H8", "H9", "H10", "H11", "H12", "H13",
"C1", "C2", "C3", "C4", "C5", "C6", "C7", "C8", "C9", "C10", "C11", "C12", "C13",
"D1", "D2", "D3", "D4", "D5", "D6", "D7", "D8", "D9", "D10", "D11", "D12", "D13",
"J1", "J2"};
int main(){
int cnt, rnd[55];
scanf("%d", &cnt);
for(int i = 1; i <= 54; i++){
scanf("%d", &rnd[i]);
}
string tmp[55];
for(int i = 0 ; i < cnt; i++){
for(int j = 1; j <= 54; j++){
tmp[ rnd[j] ]= map[j];
}
for(int j = 1; j <= 54; j++){
map[j] = tmp[j];
}
}
for(int i = 1; i <= 54; i++){
cout << map[i];
if(i!=54) cout << " ";
}
return 0;
}