1042 Shuffling Machine

本文介绍了一个名为1042ShufflingMachine的问题,该问题要求通过给定的顺序来重新排列一副扑克牌。文章提供了一种使用两个数组(旧牌和新牌)的算法实现思路,并通过C++代码展示了如何完成洗牌过程。

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

1042 Shuffling Machine

题目大意

将扑克牌按照给定的顺序,转换个几次就ok

算法思想

  • 可以写两个数组,分别为旧新数组,每次洗完排后,都得把新牌赋到旧牌上

代码

#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int>seq(55);
vector<string>oldcard(55);
vector<string>newcard(55);
void shuffling() {//洗牌
	for (int i = 1; i <= 54; i++) {
		newcard[seq[i]] = oldcard[i];
	}
	return;
}
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= 54; i++) {//初始化,不想一个一个附上去
		cin >> seq[i];
		if (i >= 1 && i <= 13)
			oldcard[i] = "S" + to_string(i);
		else if (i >= 14 && i <= 26)
			oldcard[i] = "H" + to_string(i - 13);
		else if (i >= 27 && i <= 39)
			oldcard[i] = "C" + to_string(i - 26);
		else if (i >= 40 && i <= 52)
			oldcard[i] = "D" + to_string(i - 39);
		else
			oldcard[i] = "J" + to_string(i - 52);
	}
	for (int i = 0; i < n; i++)//洗牌
	{
		shuffling();
		oldcard = newcard;//更新旧牌
	}
	cout << newcard[1];
	for (int i = 2; i <= 54; i++)
		cout << " " << newcard[i];
	return 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、付费专栏及课程。

余额充值