# PAT1042 Shuffling Machine (20分) 用1-54代替点数更方便哦

### 题目

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`

### 题目解析

• 首先，为了操作方便，我们把 `S1-S13,H1-H13,C1-C13,D1-D13,J1-J2` 分别用数字 `1-54`代替，操作完成后，再转成对应的字符加数字即可。
• 所谓洗牌规则，把第 `i` 张牌挪到第 `j` 个位置去，就是 `a[j] = a[i]`
• 由于有多次洗牌，我们要记录每一次洗牌的初始状态，和结束状态，本次结束状态就是下一次的初始状态；
• 初始时牌面是`1-54`顺序存放。

### 完整代码

```#include <iostream>
using namespace std;

// 刚开始的牌有序
// S1, S2, ..., S13,
// H1, H2, ..., H13,
// C1, C2, ..., C13,
// D1, D2, ..., D13,
// J1, J2
// 为了方便处理，直接用1-54代替

int main() {
// cnt次洗牌
int cnt;
cin >> cnt;
// 每次洗牌，第i个位置的排应该挪到到location[i]的位置去
// 保存每次洗牌，开始时的状态，按给定的顺序规则洗完后的状态
int start[55], end[55];
int location[55];
for (int i = 1; i <= 54; ++i) {
cin >> location[i];
// 按开始状态初始化
start[i] = i;
}
// cnt次洗牌
while(cnt-- > 0) {
// 第i个位置的排应该挪到到location[i]的位置去
for (int i = 1; i<= 54; ++i) {
end[location[i]] = start[i];
}
// 本次洗完后的结果，作为下次洗牌的开始状态
for (int i = 1; i<= 54; ++i) {
start[i] = end[i];
}
}
// 结束后，再把1-54转成对应的牌面,1--S1,14--H1,27--C1,40--D1,53--J1
char c[6] = "SHCDJ";
for (int i = 1; i <= 54; ++i) {
end[i] = end[i] - 1;
printf("%c%d", c[end[i] / 13], end[i] % 13 + 1);
if (i != 54) cout << " ";
}
return 0;

}```

0 条评论

• ### PAT 1030 Travel Plan (30分) Dijstra +Dfs

A traveler's map gives the distances between cities along the highways, together...

• ### PAT 1035 Password (20分) 字符替换

To prepare for PAT, the judge sometimes has to generate random passwords for the...

• ### PAT 1012 The Best Rank (25分) sort()排序就完了

To evaluate the performance of our first year CS majored students, we consider t...

• ### POJ1258:Agri-Net-最小生成树

Farmer John has been elected mayor of his town! One of his campaign promises was...

• ### Milvus 如何实现数据动态更新与查询

在这篇文章，我们会主要描述 Milvus 里向量数据是如何被记录在内存中，以及这些记录以怎样的形式维护。

• ### 大数据如何变化并影响互联网运营

众所周知，通过计算每时每刻都会产生大量的用户数据。通过社交网络数据库和GPS(全球定位系统)，每个人使用某些应用程序时所在的位置，以及他们的行为，观点，兴趣和所...

• ### LeetCode Weekly Contest 44解题思路

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.n...

• ### [android] 轮播图-无限循环

在getCount()方法中，返回一个很大的值，Integer.MAX_VALUE

• ### 为什么MySQL内存占用这么大？ for InnoDB

这是 Innodb 引擎最重要的缓存，也是提升查询性能的重要手段。一般是global共享内存中占用最大的部分。在进行 SQL 读和写的操作时，首先并不是对物理数...

• ### Cleaning Shifts POJ - 2376 (经典区间贪心)

Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleani...