pat 1042 Shuffling Machine(20 分)
1042 Shuffling Machine(20 分)
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 #include <iostream> 2 #include <algorithm> 3 #include <cstdio> 4 #include <cstring> 5 #include <map> 6 #include <stack> 7 #include <vector> 8 #include <queue> 9 #include <set> 10 #define LL long long 11 using namespace std; 12 const int MAX = 100; 13 14 int n, A[MAX]; 15 16 char s[MAX][4] = {" ", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "S10", "S11", "S12", "S13", 17 "H1", "H2", "H3", "H4", "H5", "H6", "H7", "H8", "H9", "H10", "H11", "H12", "H13", 18 "C1", "C2", "C3", "C4", "C5", "C6", "C7", "C8", "C9", "C10", "C11", "C12", "C13", 19 "D1", "D2", "D3", "D4", "D5", "D6", "D7", "D8", "D9", "D10", "D11", "D12", "D13", 20 "J1", "J2" 21 }; 22 char buf[MAX][4]; 23 24 int main() 25 { 26 // freopen("Date1.txt", "r", stdin); 27 scanf("%d", &n); 28 for (int i = 1; i <= 54; ++ i) 29 scanf("%d", &A[i]); 30 31 for (int i = 1; i <= n; ++ i) 32 { 33 for (int j = 1; j <= 54; ++ j) 34 strcpy(buf[A[j]], s[j]); 35 for (int j = 1; j <= 54; ++ j) 36 strcpy(s[j], buf[j]); 37 } 38 39 for (int i = 1; i <= 53; ++ i) 40 printf("%s ", s[i]); 41 printf("%s\n", s[54]); 42 return 0; 43 }
相关文章
- 20 - CommonJS - 规范的具体内容
- 排名前20位的大数据职位及其职责,你能胜任么
- linux shell 脚本攻略学习20--awk命令入门详解
- [React] Broadcaster + Operator + Listener pattern -- 20. useBroadcaster & useListener Example
- Qt编写自定义控件20-自定义饼图
- 基于STM32F429的自适应滤波器教程,无需matlab生成系数,支持自学习(2021-09-20)
- 【STM32H7的DSP教程】第20章 DSP复数运算-模平方,乘法和复数乘实数
- 7-16 装箱问题 (20 分)
- L1-034 点赞 (20 分)—团体程序设计天梯赛
- 1002 写出这个数 (20 分)—PAT (Basic Level) Practice (中文)
- bfs——练习demo4(20届周新杰提供)
- Python新手的福音,涵盖20+种初学者必练项目!
- 补习系列(20)-大话 WebSocket 与 "尬聊"的实现
- Python遇上Excel,这20个常用操作也可以轻松操作
- Python学习20:高级特性
- 【云原生 | 20】Docker资源限制详解
- 【回答问题】ChatGPT上线了!给我推荐20个比较流行的AI作画模型!
- 【回答问题】ChatGPT上线了!给我推荐20个比较流行的深度学习模型
- Python小白的数学建模课-20.网络流优化案例
- 【Deepin 20系统】解决MATLAB等Linux软件只能root用户下才能启动
- FPGA 20个例程篇:2.按键控制蜂鸣器输出PWM波,发出不同频率响声