题目
题目描述
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
题目大意
对一副顺序初始化的扑克(54)张,进行洗牌,第一个输入N,意味着要洗N次,接下来一个数组意思是此数组下标那张扑克移动到此数组元素那个位置。要求输出洗好的扑克。
思路
- 扑克牌可以用一个结构体表示,分别表示其花色和数字
- 先生成一副初始化的扑克牌
- 关键部分就是排序过程,只需要借助一个中间数组next
代码
#include<iostream>
using namespace std;
typedef struct card{
string sign;//存放卡牌符号
int num;//存放卡牌数字
}card;
int main(){
card all[2][54];//存放一副扑克牌
int n=0;
string allsign[]={"S","H","C","D","J"};
for(int i=0;i<5;++i){
for(int j=1;j<14;++j){
all[0][n].num=j;
all[0][n++].sign=allsign[i];
if(n>53)break;
}
}
int times;
cin>>times;
bool odd=1;
int newshunxu[54];
for(int i=0;i<54;++i){
cin>>newshunxu[i];
}
for(int i=0;i<times;++i)
{
for(int j=0;j<54;++j){
all[odd][newshunxu[j]-1]=all[!odd][j];
}
odd=!odd;
}
for(int i=0;i<53;++i){
cout<<all[!odd][i].sign<<all[!odd][i].num<<" ";
}
cout<<all[!odd][53].sign<<all[!odd][53].num;
return 0;
}