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 47Sample 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 #include<stdio.h> int main(){ int n=54,k;//设定一共有54个数 char mp[5]={'S','H','C','D','J'};//设定五种牌型int k; int start[n+1],end[n+1],next[n+1];//分别代表牌在开始的位置和结束的位置 scanf("%d",&k);//输入循环次数 for(int i=1;i<=n;i++){ start[i]=i;//初始化编号 } //输入 for(int i=1;i<=n;i++){ scanf("%d",&next[i]);//输入每个位置上的牌在操作后的位置 } for(int step =0;step<k;step++)//大循环次数，小于k次 { for(int i=1;i<=n;i++){ end[next[i]]=start[i];//将数组最刚开始的数据，放入end数组里面，并且用next数组储存数字,运行完end数组其实 } for(int i=1;i<=n;i++){ start[i]=end[i];//将end数组赋给start数组，以供下次操作 } } //计算 //比方：S3,H5,C1,D13,J2 输入：4 2 5 3 1 //第一步：将S3,H5,C1,D13,J2 这一组数据赋值给end[4]、end[2]、end[5]、end[3]、end[1] //结果得到：end[1]=J2,end[2]=H5,end[3]=D13,end[4]=S3,end[5]=C1 //第二步：赋值给start[i],让下次循环能继续进行计算 for(int i=1;i<=n;i++){ if(i !=1)printf(" ");//格式 start[i]--;//举个例子，假设start[i]=13，13-1=12 printf("%c%d",mp[start[i]/13],start[i]+1);//mp[12/13]=mp[0],为S，12+1=13,结果为S13 } printf("\n"); return 0; }