【每日刷题】数据结构起步自测题 自测-5 Shuffling Machine (20 分)

题目描述:
在这里插入图片描述
在这里插入图片描述
代码如下:

//zc-5
#include <stdio.h>

typedef struct PK{
	char c;
	int i;
}P;

int main ( void )
{
	int k, i, j;
	P p[54];
	scanf( "%d", &k ); 
	int a[54];
	for( i = 0; i < 54; i++ )
		scanf( "%d", &a[i] );
	for( i = 0; i < 54; i++ ){
		if( i < 13 ){
			p[i].c = 'S';
			p[i].i = i % 13 + 1;
		}
		else if( i < 26 ){
			p[i].c = 'H';
			p[i].i = i % 13 + 1;
		}
		else if( i < 39 ){
			p[i].c = 'C';
			p[i].i = i % 13 + 1;
		}
		else if( i < 52 ){
			p[i].c = 'D';
			p[i].i = i % 13 + 1;
		}
		else{
			p[i].c = 'J';
			p[i].i = i % 13 + 1;
		}
	}

	for( j = 0; j < k; j++ )
	{
		P s1[54];
		for( i = 0; i < 54 ; i++ )
			s1[ a[i] - 1 ] = p[i];
		for( i = 0; i < 54; i++ )
			p[i] = s1[i];
	}
	for( i = 0; i < 54; i++ ){
		if( i != 53 )
			printf( "%c%d ", p[i].c, p[i].i );
		else
			printf( "%c%d", p[i].c, p[i].i );
	}
	return 0;	
}
  • 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
发出的红包

打赏作者

房东的小黑

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值