Shuffling Machine

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 (≤) 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

#include<stdio.h>
//#define P 54
int main()
{
    char color[5]={'S','H','C','D','J'};            //color为花色数组 ； 
    int P=54;                                        //本题建议使用int 写死P的数值；define定义P值，会使程序整体运行时间变长  define 384ms  int 256ms 
    int start[P],end[P],operate[P];                    //start为初始卡牌数组；end为操作后卡牌数组；operate为操作次序数组 ； 
    int K,i;
        for(i=0;i<P;i++)                            //初始化填充start数组 ； 
        {
            start[i]=i+1;
        }
 
        scanf("%d",&K);                                //输入变化的次数 
 
                for(i=0;i<P;i++)                     //输入操作变化的数组 
            {
                scanf("%d",&operate[i]);
            }    
        /*****************数据检查*********************
                for(i=0;i<P;i++)
            {                                        //输出初始化的start[i]数组，检查是否初始化正确。运行时注释掉本段； 
            printf("%d ",start[i]);
            }                                        
                for(i=1;i<=P;i++)                    //运行时注释掉本段 
            {
                printf("%d ",operate[i]);
            }
        /**********************************************/
        
        
/***********************************主要函数***************************************/        
 
    for(int step = 0;step < K; step++)              //执行K次操作——对start数组进行修改的次数 ； 
    {
        for(i=0;i<P;i++)
        {
            end[operate[i]-1]=start[i];                //根据operate数组的指令交换指定位置的start与end； 
        }
        for(i=0;i<P;i++)
        {
            start[i]=end[i];                        //再次交换start与end数组，使start数组成为进行了1次位置变化的数组，方便进行后续操作；    
        } 
    }
        for(i=0;i<P;i++)
    {
        start[i]--;
        if(i!=0)printf(" ");
        printf("%c%d",color[start[i]/13],start[i]%13+1);    
    }
/**********************************************************************************/            
     return 0;
 }