PAT-A1042 Shuffling Machine (卡片交换)

最新推荐文章于 2024-10-03 13:32:34 发布

terter努力学习中|･ω･｀)

最新推荐文章于 2024-10-03 13:32:34 发布

阅读量74

点赞数

分类专栏： PAT甲级刷题

本文链接：https://blog.csdn.net/weixin_46055626/article/details/120228432

版权

c语言算法

PAT甲级刷题专栏收录该内容

36 篇文章 0 订阅

订阅专栏

A1042 Shuffling Machine (卡片交换)

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

结尾无空行

题意：

init：S3, H5, C1, D13 , J2

order：4, 2, 5, 3, 1

把第一个S3移动到第四的位置，第二个H5移动到第二个位置。。。

ans：J2, H5, D13, S3, C1

分析：

1.大写字母都转换成数字，然后新建三个数组，分别储存初始数组，顺序数组，结果数组。

2.接收数值

3.根据交换规则，ans[order[i]]=init[i]，紧接着更改init数组的值

4.输出结果值，注意ans[i]=13时，取余13为0；

代码如下：

#include<cstdio>
char pre[5]={'S','H','C','D','J'};
int main(){
	int k;
	char init[55];
	char order[55];
	char ans[55];
	scanf("%d",&k);
	for(int i=1;i<=54;i++){
		init[i]=i;
	}
	for(int i=1;i<=54;i++){
		scanf("%d",&order[i]);
	}
	for(int i=0;i<k;i++){
		for(int i=1;i<=54;i++){
			ans[order[i]]=init[i];
		}
		for(int i=1;i<=54;i++){
			init[i]=ans[i];//注意此处的init数组已经改变 
		}
	}
	for(int i=1;i<=54;i++){
		if(i!=1) printf(" ");
		ans[i]--;//注意：此处先减的目的是如果ans[i]=13,那么cp处要为12来除才能是原来的 
		printf("%c%d",pre[ans[i]/13],ans[i]%13+1);
	} 
	
	return 0;
}