自测-5 Shuffling Machine【PTA】

编程练习题目集目录

题目

  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:
  机器根据给定的随机顺序对一副54张牌进行洗牌，并重复给定的次数。这里假定一副扑克牌的初始状态顺序如下：

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.
  其中 $“S”$ 代表“黑桃”，$“H”$ 代表“红桃”，$“C”$ 代表“梅花”，$“D”$ 代表“方块”，$“J”$ 代表“大王和小王”。给定的顺序是区间 $[1,54]$ 中不同整数的排列。如果第 $i$个位置的数字是 $j$ ，这意味着将卡片从位置i移动到位置 $j$。例如，假设我们只有 $5$张卡片：$S3、H5、C1、D13$ 和 $J2$ 。给定洗牌顺序 $4,2,5,3,1$ ，结果将是：$J2,H5,D13,S3,C1$ 。如果我们要重复洗牌，结果将是：$C1,H5,S3,J2,D13$ 。

输入格式

  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.
  每个输入文件包含一个测试用例。对于每种情况，第一行包含一个正整数 $K(\le 20)$ ，$K$ 是重复次数。然后下一行包含给定的顺序。一行中的所有数字都用空格隔开。

输出格式

  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.
  对于每个测试用例，将洗牌结果打印在一行中。所有卡片之间都有一个空格，行尾不能有多余的空格。

输入样例

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

输出样例

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

其它要求

代码长度限制：16 KB
时间限制：400 ms
栈限制：8192 KB
内存限制：64 MB

题解

解题思路

  根据题目要求，输入相应的数据。需要用一个数组 $cards[56]$ 存储一副牌的初始状态，由于洗牌位置从 $1$ 开始，因此存储初始状态时注意数组下标。因为洗牌次数确定，因此使用 $for$ 循环，循环 $K$ 次。洗牌操作根据题目要求，进行洗牌，先用 $temp[56]$ 记录当前扑克牌状态，然后根据输入的法则进行洗牌，重复 $K$ 次后直接输出即可。

完整代码

#include
using namespace std;

int main(void)
{
    int K, order[60] = {};
    string temp[56], cards[56] = { "","S1","S2","S3","S4","S5","S6","S7","S8","S9","S10","S11","S12","S13","H1","H2","H3","H4","H5","H6","H7","H8","H9","H10","H11","H12","H13","C1","C2","C3","C4","C5","C6","C7","C8","C9","C10","C11","C12","C13","D1","D2","D3","D4","D5","D6","D7","D8","D9","D10","D11","D12","D13","J1","J2" };		// 一副扑克牌
    cout << "请输入重复次数：";                 // 提交时注释此行
    cin >> K;
    cout << "请输入给定的洗牌顺序：";            // 提交时注释此行
    for (int i = 1; i <= 54; i++) {
        cin >> order[i];
    }
    for (int i = 0; i < K; i++)                // 洗 K 次
    {
        for (int j = 1; j <= 54; j++) {        // 记录起始位置
            temp[j] = cards[j];
        }
        for (int j = 1; j <= 54; j++) {         // 洗牌交换位置
            cards[order[j]] = temp[j];
        }
    }
    cout << "洗牌结果为：";            // 提交时注释此行
    for (int i = 1; i <= 54; i++)
    {
        cout << cards[i];
        if (i < 54) cout << " ";
    }
    return 0;
}