1042 Shuffling Machine (20 分)

最新推荐文章于 2025-07-19 19:15:00 发布

Tropine

最新推荐文章于 2025-07-19 19:15:00 发布

阅读量117

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT 甲级文章标签： c++ PAT

本文链接：https://blog.youkuaiyun.com/Tropine/article/details/120590480

PAT 甲级专栏收录该内容

34 篇文章

订阅专栏

本文介绍如何使用C++实现一个自动洗牌机器，根据给定的随机顺序重复多次地打乱扑克牌，包括Spades、Hearts、Clubs、Diamonds和Joker的分布。通过实例演示了输入格式和输出格式，以及代码实现过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Analysis

一道大模拟题，模拟洗牌的过程。理解题意就很快了。输入的第一个数字是按要求洗牌的次数，接着输入的数字是代表相应位置上的牌去的位置。比如第二行第一个数字是36，代表第一张牌去第36号位。

Code(C++)

#include <iostream>
using namespace std;

int main()
{
    int a[54], b[54], c[54];
    int n;
    cin >> n;
    
    for(int j=0; j<54; j++)
    {
        a[j] = j + 1;
        cin >> b[j];
    }
    for(int i=0; i<n; i++)
    {
        
        for(int j=0; j<54; j++)
        {
            c[b[j]-1] = a[j];
        }
        for(int j=0; j<54; j++)
        {
            a[j] = c[j];
        }
    }
    
    bool flag = true;
    for(int i=0; i<54; i++)
    {
        if(flag)
            flag = false;
        else
            cout << " ";
        
        int tmp = a[i] / 13;
        if(tmp == 0)
            cout << "S";
        else if(tmp == 1)
            cout << "H";
        else if(tmp == 2)
            cout << "C";
        else if(tmp == 3)
            cout << "D";
        else
            cout << "J";
        
        if(a[i] % 13 == 0)
            cout << 13;
        else
            cout << a[i] % 13;
    }
    
    
    return 0;
}