PAT A1042 Shuffling Machine

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

参考代码：

/***********************************************
PAT A1042 Shuffling Machine
***********************************************/
#include <iostream>
#include <vector>

using namespace std;

const int MAX_NUM = 13;
const int CARD_AMOUNT = 54;
const char CARD_SHAPE[5] = { 'S', 'H', 'C','D', 'J' };

int main() {
    int time = 0;
    vector<int> order(CARD_AMOUNT, 0);    //记录随即时的顺序
    vector<int> resoult(CARD_AMOUNT, 0);  //记录洗牌后的结果

    cin >> time;
    
    for (int i = 0; i < CARD_AMOUNT; ++i) {
        cin >> order[i];
    }

    for (int i = 0; i < CARD_AMOUNT; ++i) {
        int newPos = i;
        for (int j = 0; j < time; ++j) {
            newPos = order[newPos] - 1;   //随机顺序中位置是[1, 54]但是vector是从0开始的因此要 - 1
        }

        resoult[newPos] = i;   //[0, 53]代表一整副牌
    }

    for (int i = 0; i < CARD_AMOUNT; ++i) {
        cout << CARD_SHAPE[resoult[i] / MAX_NUM] << resoult[i] % MAX_NUM + 1;   //存储结果时牌面的编号是从0开始的因此需要 + 1
        if (i != CARD_AMOUNT - 1) cout << ' ';
    }

    return 0;
}

 

注意事项：

　　1：上述代码中存储牌的编号的时候是从0开始的，但实际上不存在牌面为0的牌，因此需要进一步处理（存储的牌的编号 + 1 = 实际的编号）。可以通过多申请一个空间vector<in> resoult(55， 0）并放弃resoult[0]，用resoult[1]~resoult[54]来存储卡牌面值，省去特殊处理的部分。