问题描述
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
中文释义
洗牌就是将一副牌的顺序打乱。
为了防止员工洗牌不够彻底或者员工串通赌徒出老千,许多娱乐场都用自动洗牌机来洗牌。
洗牌机会根据一套随机产生的打乱顺序,将一套牌(54张)进行若干次的洗牌操作。
假设一副牌的最开始时按如下顺序排列:
S1, S2, ..., S13,
H1, H2, ..., H13,
C1, C2, ..., C13,
D1, D2, ..., D13,
J1, J2
其中,S表示黑桃,H 表示红桃,C 表示草花,D 表示方块,J表示小丑。给定一个 1∼54的排列表示打乱顺序,如果第 i 个位置的数字是 j,则意味着现在处于位置 i 的卡牌在洗牌结束后要出现在位置 j。假设我们一共只有 5张卡牌,S3, H5, C1, D13, J2
,给定的打乱顺序为 {4, 2, 5, 3, 1}
。
洗牌一次后,卡牌顺序变为 J2, H5, D13, S3, C1
,再洗一次,卡牌顺序变为 C1, H5, S3, J2, D13
。
输入格式
第一行包含整数 K,表示洗牌次数。第二行包含一个 1∼54的排列,表示打乱顺序。
输出格式
输出洗牌完成后的最终卡牌顺序。占一行。数据范围K≤20
输入样例:
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
题解
jiu 存储当前牌的顺序
ne 存储下标转换关系
xin 存储转换后的结果
#include<bits/stdc++.h>
using namespace std;
int k;
vector<int> jiu(55),ne(55),xin(55);
char ma[5]={'S','H','C','D','J'};
void pri(int a){
cout<<ma[(a-1)/13];
cout<<(a-1)%13+1;
}
int main(){
cin>>k;
for(int i=1;i<=54;i++){
jiu[i]=i;
}
for(int i=1;i<=54;i++){
cin>>ne[i];
}
while(k--){
for(int i=1;i<=54;i++){
xin[ne[i]]=jiu[i];
}
jiu=xin;
}
for(int i=1;i<=54;i++){
if(i!=1)cout<<" ";
pri(jiu[i]);
}
}
注意与要点
(1)类别: 模拟
(2)每类的第十三张牌仍属于该类 写法采用((a-1)%13+1 这也是将数限制在【1,n】的常用方法
(3)字符数组的写法可以简化代码量