题185.pat甲级练习-1042 Shuffling Machine (20 分)


题185.pat甲级练习-1042 Shuffling Machine (20 分)


一、题目

在这里插入图片描述

二、题解

本题让你洗牌,每轮洗牌将当前位置的牌放到输入的规则规定的位置即可。

#include <bits/stdc++.h>

using namespace std;

string cards[21][55];
int rule[55];

int main()
{
    for(int i=0,j=1;i<5;i++)
    {
        if(i<4)
        {
            for(int k=1;k<=13;k++)
            {
                if(i==0)
                {
                    cards[0][j]="S";
                }
                else if(i==1)
                {
                    cards[0][j]="H";
                }
                else if(i==2)
                {
                    cards[0][j]="C";
                }
                else if(i==3)
                {
                    cards[0][j]="D";
                }
                string post=to_string(k);
                cards[0][j]+=post;
                j++;
            }
        }
        else
        {
            for(int k=1;k<=2;k++)
            {
                cards[0][j]="J";
                string post=to_string(k);
                cards[0][j]+=post;
                j++;
            }
        }
    }
    int K;
    cin>>K;
    for(int i=1;i<=54;i++)
    {
        scanf("%d",&rule[i]);
    }
    for(int i=0;i<K;i++)
    {
        for(int j=1;j<=54;j++)
        {
            cards[i+1][rule[j]]=cards[i][j];
        }
        if(i==K-1)
        {
            for(int j=1;j<=54;j++)
            {
                if(j>1)
                {
                    putchar(' ');
                }
                cout<<cards[i+1][j];
            }
        }
    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
A shuffling machine in C++ can be implemented using an array to represent the deck of cards and using the random number generator to shuffle the cards. Here is a sample code for a shuffling machine: ``` #include <iostream> #include <cstdlib> #include <ctime> using namespace std; const int NUM_CARDS = 52; class ShufflingMachine { private: int deck[NUM_CARDS]; int position; public: ShufflingMachine() { for (int i = 0; i < NUM_CARDS; i++) { deck[i] = i; } position = 0; } void shuffle() { srand(time(NULL)); for (int i = 0; i < NUM_CARDS; i++) { int j = rand() % NUM_CARDS; swap(deck[i], deck[j]); } position = 0; } int dealCard() { if (position >= NUM_CARDS) { shuffle(); } return deck[position++]; } }; int main() { ShufflingMachine shuffler; shuffler.shuffle(); for (int i = 0; i < NUM_CARDS; i++) { cout << shuffler.dealCard() << " "; } cout << endl; return 0; } ``` In this code, the `ShufflingMachine` class represents the shuffling machine. The `deck` array stores the deck of cards, and the `position` variable keeps track of the current position in the deck. The `shuffle` method shuffles the deck by randomly swapping cards. It uses the `srand` function to seed the random number generator with the current time, and the `rand` function to generate random indices for swapping cards. The `dealCard` method deals the next card from the deck. If the deck has been exhausted, it calls the `shuffle` method to shuffle the cards again. In the `main` function, we create a `ShufflingMachine` object and shuffle the cards. Then we deal all the cards and print them out.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值