PTA Shuffling Machine-洗牌

最新推荐文章于 2024-04-14 21:37:14 发布

原创最新推荐文章于 2024-04-14 21:37:14 发布 · 213 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#c语言

PTA习题专栏收录该内容

32 篇文章

订阅专栏

本文介绍如何使用编程实现洗牌机算法，通过给定随机顺序对54张扑克牌进行多次混洗，展示了如何将特定初始排列转换成随机分布。关键步骤包括读取输入次数和洗牌顺序，然后通过迭代执行交换操作模拟实际洗牌过程。

Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid "inside jobs" where employees collaborate with gamblers by performing inadequate shuffles, many casinos employ automatic shuffling machines. Your task is to simulate a shuffling machine.

The machine shuffles a deck of 54 cards according to a given random order and repeats for a given number of times. It is assumed that the initial status of a card deck is in the following order:

S1, S2, ..., S13, 
H1, H2, ..., H13, 
C1, C2, ..., C13, 
D1, D2, ..., D13, 
J1, J2

where "S" stands for "Spade", "H" for "Heart", "C" for "Club", "D" for "Diamond", and "J" for "Joker". A given order is a permutation of distinct integers in [1, 54]. If the number at the i-th position is j, it means to move the card from position i to position j. For example, suppose we only have 5 cards: S3, H5, C1, D13 and J2. Given a shuffling order {4, 2, 5, 3, 1}, the result will be: J2, H5, D13, S3, C1. If we are to repeat the shuffling again, the result will be: C1, H5, S3, J2, D13.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer K (≤20) which is the number of repeat times. Then the next line contains the given order. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the shuffling results in one line. All the cards are separated by a space, and there must be no extra space at the end of the line.

Sample Input:

2
36 52 37 38 3 39 40 53 54 41 11 12 13 42 43 44 2 4 23 24 25 26 27 6 7 8 48 49 50 51 9 10 14 15 16 5 17 18 19 1 20 21 22 28 29 30 31 32 33 34 35 45 46 47

Sample Output:

S7 C11 C10 C12 S1 H7 H8 H9 D8 D9 S11 S12 S13 D10 D11 D12 S3 S4 S6 S10 H1 H2 C13 D2 D3 D4 H6 H3 D13 J1 J2 C1 C2 C3 C4 D1 S5 H5 H11 H12 C6 C7 C8 C9 S2 S8 S9 H10 D5 D6 D7 H4 H13 C5

#include<stdio.h>
int main()
{
	int k;
	scanf("%d",&k);//洗牌重复次数 
	int i,shuffleMode[54],card1[54],card2[54];
	for(i=0;i<54;i++)
	{
		scanf("%d",&shuffleMode[i]);//洗牌顺序,shuffleMode[i]>=1 
	}
	for(i=0;i<54;i++)
	{
		card1[i]=i;//初始化原始牌组，以数字0到53代表S1,S2,……,J1,J2 
	}
	
	int step;
	for(step=0;step<k;step++) 
	{
		for(i=0;i<54;i++)
		{
			card2[shuffleMode[i]-1]=card1[i];//洗牌1次 
		}
		for(i=0;i<54;i++)
		{
			card1[i]=card2[i];//洗牌1次的结果传回card1 
		}
		 
	}
	char colour[5]={'S','H','C','D','J'};//花色 数组 
	for(i=0;i<54;i++)
	{
		printf("%c%d",colour[card1[i]/13],card1[i]%13+1);//colour[card1[i]/13]能够正确取到花色， 
		if(i<53)
		{
			printf(" ");
		}
	}
	return 0;
}