PAT Shuffling Machine(20 分)(题解)

题意很简单,就是按照给定的序列order[],将第i个位置的牌移到第order[i]位置.

注意多次洗牌需要保留上次的顺序基础上进行,不能破坏。

#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string.h>
/*
Created by HarvestWu on 2018/5/1.
*/
using namespace std;
int a[55];
int b[55];

void init()
{
	for (int i = 0; i < 55; i++)
	{
		a[i] = i;
		b[i] = i;
	}
}
void copy()
{
	for (int i = 0; i < 55; i++)
		a[i] = b[i];  //保存上次的顺序
}
int main()
{
	
	int n;
	int order[55];
	init();
	scanf("%d", &n);
	for (int i = 1; i < 55; i++)
		scanf("%d", &order[i]);
	while (n--)
	{
		for (int i = 1; i < 55; i++)
			b[order[i]] = a[i];
		copy();//备份顺序
	}
	for (int i = 1; i < 55; i++)
	{
		if (b[i]>=1&&b[i]<=13)
			printf("S%d", b[i]);
		if (b[i] >= 14 && b[i] <= 26)
			printf("H%d", b[i] - 13);
		if (b[i] >= 27 && b[i] <= 39)
			printf("C%d", b[i] - 26);
		if (b[i] >= 40 && b[i] <= 52)
			printf("D%d", b[i] - 39);
		if (b[i] >= 53 && b[i] <= 54)
			printf("J%d", b[i] - 52);
		if (i != 54)
			printf(" ");//最后一张牌后无空格
	}
	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
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值