1042 Shuffling Machine (20 分)--PAT甲级

最新推荐文章于 2022-03-14 23:45:00 发布

WananRd

最新推荐文章于 2022-03-14 23:45:00 发布

阅读量87

点赞数

分类专栏： # PAT

本文链接：https://blog.csdn.net/weixin_51173281/article/details/119766662

版权

PAT 专栏收录该内容

91 篇文章 1 订阅

订阅专栏

QuesionDescribe:
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
结尾无空行

题目分析：这题卡了好久，后来发现直接一个temp数组就能搞定的事情。

#include<iostream>
#include<algorithm>
using namespace std;
int rule[55], place[55], temp[55];
string card[55] = {"0","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"};
int main(){
	int n;
	cin >> n;
	for(int i = 1; i <= 54; i ++){
		cin >> rule[i];
		place[i] = i;
	}
	for(int i = 0; i < n; i ++){
		for(int j = 1; j <= 54; j ++){
			temp[rule[j]] = place[j];
		}  	
		memcpy(place, temp, sizeof temp);
	}
	bool flag = false;
	for(int i = 1; i <= 54; i ++){
		if(flag == false){
			flag = true;
			cout << card[place[i]];
		}else{		
			cout << " " << card[place[i]];
		}
	}
	return 0;
}