立志用最少的代碼做最高效的表達

---

PAT甲級最優(yōu)題解——>傳送門

---

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個數(shù)，若第i個數(shù)為x，則第i個數(shù)放到位置x上。將54個數(shù)按此規(guī)則全部排序，算作一輪。 重復N輪。

舉例：樣例輸入中 第一個數(shù)為36，則為將S1放到第36位。 算作一輪。 第二輪同理，36位上的數(shù)字為7，因此S1放到第7位。 也就是第七個輸出。

算法構(gòu)造請讀者參考代碼體會。

---

代碼

#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為對應(yīng)的牌值for(int i = 1; i <= 54; i++) {b[i] = a[i]; //a數(shù)組為給定的順序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年碼齡，通宵達旦的技術(shù)人生

總結(jié)

以上是生活随笔為你收集整理的【题意分析】1042 Shuffling Machine (20 分)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。