00-Self Test 5. Shuffling Machine (20)

00-Self Test 5. Shuffling Machine ()time limitms
Memory Limit65536 KB
Code Length Limitations8000 B
Procedures for the award of questions StandardauthorCHEN, Yue

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 the i-th position are J, it means to move the card from position I to position J. 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:

Each input file contains the one test case. For each case, the first line contains a positive an integer K (<=) which is the number of the 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 2 8 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

Submit Code

The problem of APL is a lot of people have done, more simple than ACM, but also difficult. I looked at this topic for almost half an hour to understand, English is a short board, there is time I must be bad to mend. The topic is to design a program, imitate shuffle machine shuffle, given the position of each card replacement sequence, figure out the order after shuffling. For example, the original order for S3,h5,c1,d13,j2, given the position of the replacement order of 4,2,5,3,1, then the result of a shuffle is c1,h5,s3,j2,d13, need two shuffle results for C1,H5,S3,J2,D13. where S stands for spades, H for Hearts, C for plum, D for Squares, J for Kings.

#include <iostream> void Outputword (int a) {int flag = A/13;      if (0 = = flag) printf ("S");      else if (1 = = flag) printf ("H");      else if (2 = = flag) printf ("C");      else if (3 = = flag) printf ("D");        else if (4 = = flag) printf ("J");  printf ("%d", a%13+1);      } #define NUM, the int main () {int n;      int S[num];      int A[num];              while (scanf ("%d", &n)! = EOF) {for (int i = 0; i < NUM; ++i) {a[i] = i;          scanf ("%d", &s[i]);              }//shuffling while (n--) {int a_back[num];              for (int i = 0; i < NUM; ++i) a_back[i] = A[i];           for (int i = 0; i < NUM; ++i) a[s[i]-1] = A_back[i];              }//output for (int i = 0; i < NUM; ++i) {Outputword (a[i]);              printf ("%d", a[i]); if (i! = NUM-1) printf ("");          else printf ("\ n");  }} return 0;   }

There are other solutions here:

1.http://blog.csdn.net/xu3737284/article/details/43112401

2.http://blog.csdn.net/andrewseu/article/details/44194755

3.http://blog.csdn.net/fang_abc/article/details/44114043

4.http://www.cnblogs.com/zengineer/p/4315803.html

00-Self Test 5. Shuffling Machine (20)