PAT 甲级 1042.Shuffling Machine (20)

题目

题目描述
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.
输入描述:
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.
输出描述:
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.

理解

按照给出的序列，将54张扑克牌重新排序，排序动作循环多次。例：序列{4, 2, 5, 3, 1}，则将原本第1个位置的元素放在第4个位置，原本第2个位置的元素不变，原本第3个位置的元素放在第5个位置，依次类推。

思路

一共用到3个数组，order数组用来记录给出的排序顺序，a用来记录每次排序的结果，初始化为自然升序序列，b是临时数组，用来辅助排序。每一轮的排序中，将a数组中j位置的元素，复制到b数组中order[j]的位置，得出的b数组则是排序一次后得出的结果，再把b的结果复制给a数组保留下来。这个排序循环n次后，即得到最终结果。

代码

#include<iostream>
using namespace std;
int main()
{
	int n=0;
	cin>>n;
	int order[54];
	for(int i=0; i<54; i++)
	{
		cin>>order[i];
		order[i]-=1;
	}
	int a[54];
	for(int i=0; i<54; i++)
	{
		a[i]=i;
	}
	for(int i=0; i<n; i++)
	{
		int b[54];
		for(int j=0;j<54;j++)
		{
			b[order[j]]=a[j];
		}
		for(int j=0;j<54;j++)
		{
			a[j]=b[j];
		}
	}
	for(int i=0;i<54;i++)
	{
		if(a[i]<13)
		{
			cout<<"S"<<a[i]+1;
		}
		else if(a[i]<26)
		{
			cout<<"H"<<a[i]-12;
		}
		else if(a[i]<39)
		{
			cout<<"C"<<a[i]-25;
		}
		else if(a[i]<52)
		{
			cout<<"D"<<a[i]-38;
		}
		else if(a[i]<54)
		{
			cout<<"J"<<a[i]-51;
		}
		if(i<53)
		{
			cout<<" ";
		}
	}
	return 0;
}