PAT日志 1042

顽强的小白

1042 Shuffling Machine （20 分）

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

翻译

我第一次看的时候理解了半天，意思是一套扑克牌，虽然这套扑克牌是字母数字组合，但
是因为有规律很好表示（这里有HASH的映射思维），咱们开始的时候只需要用1到54表示就行，最后输出的时候再把数字转化成扑克牌。
进入正题：输入部分给了两部分数字，一个是重复次数，另一个是位置信息，位置信息的用法就是把当前位置上的扑克牌移动到位置信息所指示的位置上去，比如第一张扑克牌是S1，第一个位置信息是36，于是把S1移动到第36位上去，重复次数为两次所以重复操作。

代码实现
我的代码自我感觉不是很好，好久没碰，所以一开始我的思路比较乱。 `

#include <cstdio> 
 int pos[60];    //储存位置信息
 void move(int card[]){
 int temp[60] ,newpos;
 for(int i=1;i<=54;++i){
  newpos=pos[i];
  temp[newpos]=card[i];
 }
 for(int i=1;i<=54;++i){
  card[i]=temp[i];
 }
}

int main(){
 int k,card[60];
 scanf("%d",&k);
 for(int i=1;i<=54;++i){
  card[i]=i;           //先用数字表示扑克牌面值
  scanf("%d",&pos[i]);
 }
 for(int i=0;i<k;++i){
  move(card);
 }
 int first=0;
 for(int i=1;i<=54;++i){
  if (first==0){
   first=1;
  }else{
   printf(" ");
  }
  int num=card[i]-1;     //这里需要一个小操作
  if(num/13==0)printf("S");        //把数字转换成扑克牌面值
  else if(num/13==1)printf("H"); 
  else if(num/13==2)printf("C");
  else if(num/13==3)printf("D");
  else printf("J");
  printf("%d",num%13+1);
 }
}
```javascript