# 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.

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.

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.

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

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

• 梅花 C
• 黑桃 S
• 红桃 H
• 方块 D
• 王牌 J

C1 H5 S3 J2 D13

# 思路分析：

• S   1-13
• H  14-26
• C   27-39
• D   40-52
• J   53、54

char color[5]={'S','H','C','D','J'};

(x-1)%13+1的结果则为所属花色下的牌号

0  36  52  37  38.......

A数组存储原始排序 B数组存储输入的顺序 C数组为临时数组 这三个数组均假设从下标1开始

1.C[B[i]]=A[i]

2.A[i]=C[i]

3.按照格式输出

# AC代码：

#include <stdio.h>
#include <stdlib.h>
char color[5]={'S','H','C','D','J'};
int start[55],order[55],end[55];
int main()
{
int time=0; //输入需要打乱的次数
scanf("%d",&time);
for(int i=1;i<55;i++)
{
start[i]=i;  //初始化start数组 用1-54对应牌号
}
for(int i=1;i<55;i++)
{
scanf("%d",&order[i]); //输入打乱顺序
}
for(int j=0;j<time;j++) //总共进行time次打乱
{
for(int i=1;i<55;i++)
{
end[order[i]]=start[i];//第一步C[B[i]]=A[i]
}
for(int i=1;i<55;i++)
{
start[i]=end[i]; //第二步：A[i]=C[i]  构建新的原始数组
}
}
for(int i=1;i<55;i++)
{
if(i!=1)
{
printf(" ");
}
start[i]--;
printf("%c%d",color[start[i]/13],start[i]%13+1);  //第三步 按格式输出

}
return 0;
}


1.结尾不能有空格

07-11 73

04-11 0

10-16 420

06-15 662

02-27 625

05-08 18

04-14 95

06-30 13

05-04 2627

10-10 653