Shuffling Machine (20)

Shuffling Machine (20)

时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)

题目描述

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.

输入例子:

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

输出例子:

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

解析：[4,2,5,3,1]代表洗牌后，第一张牌放第四个位置、第二张牌放第二个位置、第三张牌放第五个位置。。。，先说主要用到的代码。

//结构体构建和排序

#include<algorithm>
struct node{
    int id;
    string name;
}c[55],tmp;//产生结构体

bool cmp(const node &x, const node &y) {
    return x.id < y.id;//从小到大
}
sort(c+1,c+54+1,cmp); //排序结构体

AC代码：

#include<algorithm>
#include<iostream>
#include<sstream>
using namespace std;
struct node{
	int id;
	string name;
}c[55],tmp;
bool cmp(const node &x, const node &y) {
	return x.id < y.id;
}
void init(){	
	for(int i=1;i<=13;i++){
		stringstream ss;//int类型转string类型
		string s = "S";
		ss<<i;
		ss>>c[i].name;
		c[i].name = s + c[i].name;
		c[i].id=i;
	}
	for(int i=14;i<=26;i++){
		stringstream ss;
		string s = "H";
		ss<<i-13;
		ss>>c[i].name;
		c[i].name = s + c[i].name;
		c[i].id=i;
	}
	for(int i=27;i<=39;i++){
		stringstream ss;
		string s = "C";
		ss<<i-26;
		ss>>c[i].name;
		c[i].name = s + c[i].name;
		c[i].id=i;
	}
	for(int i=40;i<=52;i++){
		stringstream ss;
		string s = "D";
		ss<<i-39;
		ss>>c[i].name;
		c[i].name = s + c[i].name;
		c[i].id=i;
	}
	stringstream ss;
	string s = "J";
	ss<<1;
	ss>>c[53].name;
	c[53].name = s + c[53].name;
	c[53].id=53;

	stringstream ss1;
	ss1<<2;
	ss1>>c[54].name;
	c[54].name = s + c[54].name;
	c[54].id=54;
}
void print(){
	for(int i=1;i<=54;i++){
		cout<<c[i].name<<" ";
	}	
}

int main(){
	
	init();
	int n,x[55];
	cin>>n;
	for(int i=1;i<=54;i++){
		cin>>x[i];
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=54;j++){
			c[j].id = x[j];
		}
		sort(c+1,c+54+1,cmp);
	}
	print();
	return 0;
}