【题意分析】1042 Shuffling Machine (20 分)

立志用最少的代码做最高效的表达

---

PAT甲级最优题解——>传送门

---

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

---

题意：第1张-第54张扑克牌的编号分别是S1 S2…S13 H1…H13 C1…C13 D1…D13 J1 J2

输入N，以及54个数，若第i个数为x，则第i个数放到位置x上。将54个数按此规则全部排序，算作一轮。 重复N轮。

举例：样例输入中 第一个数为36，则为将S1放到第36位。 算作一轮。 第二轮同理，36位上的数字为7，因此S1放到第7位。 也就是第七个输出。

算法构造请读者参考代码体会。

---

代码

#include<bits/stdc++.h> using namespace std;string s = "0SSSSSSSSSSSSSHHHHHHHHHHHHHCCCCCCCCCCCCCDDDDDDDDDDDDDJJ"; int num[60] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,1,2,3,4,5,6,7,8,9,10,11,12,13,1,2,3,4,5,6,7,8,9,10,11,12,13,1,2,3,4,5,6,7,8,9,10,11,12,13,1,2}; int main() {int N, a[60], b[60];cin >> N;for(int i = 1; i <= 54; i++) cin >> a[i];// unordered_map<int, int>m;multimap<int, int>m; //排序但不去重，key为1,2,...54 value为对应的牌值for(int i = 1; i <= 54; i++) {b[i] = a[i]; //a数组为给定的顺序for(int j = 1; j < N; j++) { //重复N轮b[i] = a[b[i]];} // cout << b[i] << ' '; m.insert(pair<int, int>(b[i], i)); //插入值}bool flag = false;for(auto& i : m) {if(!flag) flag = true;else cout << ' ';cout << s[i.second] << num[i.second];}return 0; }

---

耗时：

---

求赞哦~

超强干货来袭 云风专访：近40年码龄，通宵达旦的技术人生

总结

以上是生活随笔为你收集整理的【题意分析】1042 Shuffling Machine (20 分)的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。