Pat Self Test-5 Shuffling Machine

Original question Connection https://pta.patest.cn/pta/test/17/exam/4/question/264

Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques is seen as weak, and in order to avoid "inside jobs" where employees collaborate WI Th 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 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 are 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 theIiI-th position isJjJ, it means to move the card from positionIII to position JJJ. For example, suppose we only has 5 cards:s3, H5, C1, D13 and J2. Given a shuffling order {4, 2, 5, 3, 1}, the result would be:j2, H5, D13, S3, C1. If we are to repeat the shuffling again, the result would be be:c1, H5, S3, J2 , D13.

Input Specification:

The

Each input file contains the one test case. For each case, the first line contains a positive integer kkk (≤20\le 20≤20) which is the number of repeat Times. Then the next line contains the given order. All the numbers in a line is separated by a space.

Output Specification:

For each test case, print the shuffling results on one line. All the cards is separated by a space, and there must is no extra space at the end of the line.

Sample Input:

236 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 S


My code is as follows, which one of the free gods can help us analyze the problem? I really can't make a mistake.

#include <stdio.h>#defineN 54structifo_p{Charp_name[3]; intP_ori; intp_res;};structIfo_p ifo[n]={{"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"}                     };voidJhint*a,structIfo_p *Ifo) {    inti,j;  for(i=0; i<n;i++) {J=0;  while(j<N) {if(ifo[j].p_ori==i+1)//The first time the function is called Ifo[j].p_ori (the attribute that is recorded as a card){Ifo[j].p_res=a[i];//give the order of each card//rearrange the order of cards             Break;} ElseJ + +;} }     for(i=0; i<n;i++)   { for(j=0; j<n;j++)    {        if(ifo[j].p_ori==i+1) {Ifo[j].p_ori=a[i]; Break;}//change the properties of a card for next use    }   }}voidprint_s (structIfo_p *Ifo) {    inti,j;  for(j=1; j<=n;j++)    { for(i=0; i<n;i++)    {        if(ifo[i].p_res==j) {printf (J==n?"%s":"%s", Ifo[i].p_name);  Break; }    }}}intMain () {intN,i,a[n]; scanf ("%d",&N);  for(i=0; i<n;i++) {ifo[i].p_ori=i+1; scanf ("%d",&a[i]);} for(i=0; i<n;i++) JH (A,IFO);//printf ("%d", Ifo[1].p_ori);print_s (IFO); return 0;}

Pat Self Test-5 Shuffling Machine