5-14 Shuffling Machine (20分)

最新推荐文章于 2022-03-24 15:13:54 发布

原创最新推荐文章于 2022-03-24 15:13:54 发布 · 454 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PTA

PTA 同时被 2 个专栏收录

55 篇文章

订阅专栏

基础题

21 篇文章

订阅专栏

本文介绍了一种使用C语言实现的模拟自动洗牌机程序。该程序通过特定的随机顺序对一副54张的扑克牌进行指定次数的洗牌。文章详细展示了如何定义牌组、读取洗牌顺序并进行多次洗牌的过程。

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

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-th position is , it means to move the card from position 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 ( $\leq 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>
#include <string.h>
int main () {
	int i, j, tmp, sub[54], repeat, flag = 0;
	char card[54][4] = {"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"}, ans[54][4];		//第二维必须4个，最后还有'\0' 
	scanf("%d", &repeat);
	//读入洗牌数据，题中1开始，因此--tmp 
	for ( i = 0; i < 54; i++ ) {
		scanf("%d", &tmp);
		sub[i] = --tmp;
	}
	//洗repeat次 
	for ( j = 0; j < repeat; j++ ) {
		//flag作用：每次交换执行，因为有效数据在两个数组中互换 
		if ( !flag ) {
			for ( i = 0; i < 54; i++ ) 
				//设洗牌后序列为ans，即ans下标为sub[i]的位置的牌是card[i] 
				strcpy( ans[sub[i]], card[i] ); 
			flag = 1;
		}
		else {
			for ( i = 0; i < 54; i++ ) 
				strcpy( card[sub[i]], ans[i] );	//反过来，因为这次原先的序列在ans中 
			flag = 0;
		}
	}
	//flag = 0，说明结果序列在card中，反之在ans中 
	if(flag == 0) {
		printf("%s", card[0]);
		for ( i = 1; i < 54; i++ )
			printf(" %s", card[i]);
	}
	else {
		printf("%s", ans[0]);
		for ( i = 1; i < 54; i++ )
			printf(" %s", ans[i]);
	}
}