PAT 1042 Shuffling Machine

本文介绍了一个基于扑克牌排序的问题解决算法。通过使用两个数组分别记录操作前后的牌序,并通过循环迭代实现特定次数的移动操作,最终输出经过指定步数移动后牌的顺序。文章包含完整的C++代码实现。

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

题目描述

在这里插入图片描述

题意

一副54张的扑克牌,按要求进行多次移动,输出最后的结果

分析

用两个数组存放操作前的排序和操作后的排序,每次操作完后把操作后的排序数组赋值给操作前的排序的数组即可
输出的时候需要输出花色,注意花色和数字的关系

#include<cstdio>
char mp[5]={'S','H','C','D','J'};
int start[55],end[55],next[55];

int main(){
	int k;
	scanf("%d",&k);
	for(int i=1;i<=54;i++)
	start[i]=i;
	for(int i=1;i<=54;i++)
	scanf("%d",&next[i]);
	for(int step=0;step<k;step++)
	{
		for(int i=1;i<=54;i++){
			end[next[i]]=start[i];
		}
		for(int i=1;i<=54;i++){
			start[i]=end[i];
		}
	}
	for(int i=1;i<=54;i++){
		if(i!=1) printf(" ");
		start[i]--;
		printf("%c%d",mp[start[i]/13],start[i]%13+1);
	}
}
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.
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值