PAT甲级A1042答案（使用C语言）

题目描述

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

题目要求总结

1.题目要模拟一个洗牌机器，这里用题目给出的例子比较容易描述他的要求；
2.牌的初始顺序为：S3, H5, C1, D13 and J2，然后我们要输入一个整数和一组整数数组，例如输入2，{4,2,5,3,1}，即把s3放到第四个位置，把H5放到第二个位置，把C1放到第五个位置，以此类推，执行完一轮后再执行一次，即输入的2表示执行两轮

结题思路

使用哈希表，即建立一个空表，直接按顺序让初始的每张牌放在空表中的他要交换的位置上，例如s3放在空表第四个位置上（下标为3），待放完之后将初始顺序更新为现在的顺序，然后再按上面的方法执行一遍，执行完输入的次数后即可。

完整代码

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;

char initial[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"};

//char initial[5][4] = {"S3", "H5", "C1", "D13", "J2"};
char box[54][4];
int times, ex_pos[54];

void change(int ex_pos[54]){
	for(int i = 0; i < 54; i++){
		strcpy(box[ex_pos[i] - 1], initial[i]);

	}
}

int main(){
	scanf("%d", &times);
	for(int i = 0; i < 54; i++){
		scanf("%d", &ex_pos[i]);
		
	}
	for(times; times > 0; times--){
		change(ex_pos);
		for(int k = 0; k < 54; k++){
			strcpy(initial[k], box[k]);
		}
	}
	for(int j = 0; j < 54; j++){
		if(j == 53) printf("%s", box[j]);
		else printf("%s ", box[j]);
		
	}		
	return 0;
}