[PAT A1042]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 (≤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

题意

1. 有54张牌初始按规定顺序排列，顺序为S1, S2, …, S13, H1, H2, …, H13, C1, C2, …, C13, D1, D2, …, D13, J1, J2。
2. 执行一种操作，用来将牌的位置改变为指定位置，给出一个序列，其中第i个数字F[i]表示将第I张牌放到第F[i]个位置上。例如, 假设只有S3, H5, C1, D13 和 J2五张牌. 给定操作序列 {4, 2, 5, 3, 1}, 结果会变成J2, H5, D13, S3, C1. 如果我们再重复一次改操作，则结果为 C1, H5, S3, J2, D13.
3. 现在需要将该操作执行K次，求最后的排列结果。

解答

因为题目给出的操作序列明确了每个位置上牌在操作后的位置，可以设置两个数组start[]和end[]来存储每一步操作前和操作后的整个牌序，并在每轮结束后用end[]覆盖start[]来准备新一轮操作。
由于一共仅5种花色，直接用if…else if…写也较简单，也可以使用一个char数组来建立编号与花色的关系。

代码如下：

#include <cstdio>

int main() {
    int n, start[54], order[54], temp, end[54];
    scanf("%d", &n);
    //getchar();
    for (int i = 0; i < 54; i++) {
        scanf("%d", &order[i]);//储存操作序列
        start[i] = i;//初始化牌的编号
    }
    for(int i = 0;i < n;i++) {
        for (int i = 0; i < 54; i++) {
            end[order[i]-1] = start[i];
        }
        for (int i = 0; i < 54; i++) {
            start[i] = end[i];//覆盖操作前数组
        }
    }

    for (int i = 0; i < 54; i++) {
        if(start[i] / 13 == 0){
            printf("S%d", start[i] % 13 + 1);//牌号是从1开始所以要+1
        }
        else if(start[i] / 13 == 1){
            printf("H%d", start[i] % 13 + 1);
        }
        else if(start[i] / 13 == 2){
            printf("C%d", start[i] % 13 + 1);
        }
        else if(start[i] / 13 == 3){
            printf("D%d", start[i] % 13 + 1);
        }
        else
            printf("J%d", start[i] % 13 + 1);
        if(i != 53)
            printf(" ");
    }
    return 0;
}