PTA 自测5

最新推荐文章于 2024-08-30 10:02:36 发布

docker_007

最新推荐文章于 2024-08-30 10:02:36 发布

阅读量212

点赞数

CC 4.0 BY-SA版权

分类专栏： PTA

本文链接：https://blog.youkuaiyun.com/weixin_41168353/article/details/79921018

PTA 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种使用C++实现的模拟洗牌机程序。该程序能够根据指定的随机顺序对一副包含54张牌（包括两张鬼牌）的扑克牌进行洗牌，并重复这一过程特定次数。输入文件包含要重复的次数以及给定的洗牌顺序。

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

自测-5 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$ ( $\leq 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.

#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
int main()
{
    string A[80]={"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"};
    int It,B[80],D[80];
  //  freopen("in.txt","r",stdin);
    cin>>It;
    for(int i=0;i<54;i++)
    {
        cin>>B[i];
        D[B[i]-1]=i;
    }
    for(int j=1;j<It;j++)
    {
        int temp[80];
        for(int i=0;i<54;i++)
        {
            temp[B[i]-1]=D[i];
        }
        for(int i=0;i<54;i++)
        {
            D[i]=temp[i];
        }
    }
     cout<<A[D[0]];
    for(int i=1;i<54;i++)
    {
        cout<<" "<<A[D[i]];
    }

}