1042 Shuffling Machine (20 分)

本文详细解析了1042ShufflingMachine题目中的模拟洗牌算法,通过定义新的字符串数组作为中间产物来临时存放卡牌,实现每次洗牌后的卡牌位置更新。代码示例展示了如何使用C++实现这一过程。

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

题目地址:1042 Shuffling Machine (20 分)

模拟题,定义一个新的字符串数组作为中间产物临时存放卡牌。每执行一次,中间数组更新一次,然后在复制到卡牌数组中。

代码

#include <bits/stdc++.h>
using namespace std;
string a[] = {"0","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"
};
string s[55];
int main() {
	//freopen("datain.txt","r",stdin);
	int n;
	scanf("%d", &n);

	int next[55];//临时数组
	next[0] = 0;
	for (int i = 1; i < 55; i++ ) {
		scanf("%d", &next[i]);
	}
	while (n--) {
		for (int i = 1; i < 55; i++) {
			s[next[i]] = a[i];
		}
		
		for (int i = 1; i < 55; i++) {
			a[i] = s[i];
		}
	}
	cout<<a[1];
	for (int i = 2; i < 55; i++) {
		cout<<" "<<a[i];
	}
	cout<<endl;
	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、付费专栏及课程。

余额充值