PTA 自动洗牌机 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:
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 S9 H10 D5 D6 D7 H4 H13 C5
上述讲的54张扑克牌的洗牌问题，初始状态下扑克牌按黄色背景排列的。
S-黑桃 H-红桃 C-梅花 D-方块
如果你只有5牌牌，分别是 S3, H5, C1, D13 和 J2 ；按顺序 {4, 2, 5, 3, 1}，第一次洗牌后，牌的顺序变成了J2, H5, D13, S3, C1（意思是S３移到第４个位置，H５还在第二位置，C１移到第５个位置……）；按前边的洗牌顺序再次洗牌后，牌的顺序就变成了 C1, H5, S3, J2, D13
输入：第1行为重复次数；第2行为洗牌的顺序
输出：洗牌后的牌的花色排序
弄懂题意后，比较简单。
1.先将初始花色情况加入赋值给1个长度为54的扑克数组；将洗牌顺序赋值给排序数组；
2.新建一个54长度的中间数组，中间数组index=排序数组值，中间数组[排序数组[i]]=扑克数组[i] newCard[listOrder[j]-1] = listCards[j];
3.扑克数组赋值为中间数组
4.需要洗几次就重复前3步几次
上述是比较简单的一种做法；当然还有其他做法。不需要新建一个中间数组，只要新建一个中间变量temp，先将扑克数组中的第一个值，应移到指定位置的值赋值给temp,然后将第一个值赋值给该位置值，再找temp原位置值应该移到何处，重复上前述操作……但此相对就比较麻烦了。