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

例如,假设我们只有5张卡:S3、H5、C1、D13和J2。给定洗牌顺序{4,2,5,3,1},结果将是:J2,H5,D13,S3,C1。如果我们再次重复洗牌,结果将是:C1、H5、S3、J2、D13。

#include <bits/stdc++.h>
using namespace std;string ret[]={"",
"S1","S2","S3","S4","S5","S6","S7","S8","S9","S10","S11","S12","S13",
"H1","H2","H3","H4","H5","H6","H7","H8","H9","H10","H11","H12","H13",
"C1","C2","C3","C4","C5","C6","C7","C8","C9","C10","C11","C12","C13",
"D1","D2","D3","D4","D5","D6","D7","D8","D9","D10","D11","D12","D13",
"J1","J2"};int main(){int a[100]={0},b[100]={0},c[100]={0};int n; cin>>n; for(int i=1;i<=54;i++){b[i]=i;  //1 2 3 4 5…… b[i]cin>>a[i]; //  输入的    a[i] 36 52 37 38} while(n--){for(int i=1;i<=54;i++){c[a[i]]=b[i]; //c[36]=1,c[52]=2}memcpy(b,c,sizeof c);// //void *memcpy(void *destin, void *source, unsigned n)//从源source中拷贝n个字节到目标destin中 }for(int i=1;i<=54;i++){if(i!=1)cout<<" ";cout<<ret[c[i]];} return 0;
}

7-5 Shuffling Machine (20分)相关推荐

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

    立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 Shuffling is a procedure used to randomize a deck of playing card ...

  2. pat00-自测5. Shuffling Machine (20)

    00-自测5. Shuffling Machine (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue Sh ...

  3. 1042. Shuffling Machine (20)

    1042. Shuffling Machine (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Shu ...

  4. Shuffling Machine (20)

    Shuffling Machine (20) 时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小) 题目描述 Shuffling ...

  5. 1042 Shuffling Machine (20 point(s)) - C语言 PAT 甲级

    1042 Shuffling Machine (20 point(s)) Shuffling is a procedure used to randomize a deck of playing ca ...

  6. 1042. Shuffling Machine (20)-PAT甲级真题

    Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techn ...

  7. PAT:1042. Shuffling Machine (20) AC

    #include<stdio.h> #include<stdlib.h> const int N=54; int main() { char mp[5]={'S','H','C ...

  8. Shuffling Machine(C语言实现)

    Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techn ...

  9. PAT-A-1042 Shuffling Machine

    菩提本无树,明镜亦非台.本来无一物,何处惹尘埃 Shuffling is a procedure used to randomize a deck of playing cards. Because ...

最新文章

  1. jenkins部署net core初探
  2. 移动端 元素外面使用伪类after加边框 导致其内部元素无法选中
  3. 仿ISQL功能的实现,可以实现批处理功能
  4. mac mysql 列表_Mac终端操作Mysql,以及Mysql的操作方法详解
  5. python 标签数量_python实现的批量分析xml标签中各个类别个数功能示例
  6. html 自定义文件选择,html5 自定义文件上传
  7. IIS站点更改.net版本命令
  8. 【推荐论文】基于多视角学习和个性化注意力机制的新闻推荐(附论文下载链接)...
  9. GitHub上整理的一些工具[转载]
  10. 使用U盘制作win10启动盘
  11. 迅雷极速版禁止自动升级的方法
  12. 下行法求最小割集案例_故障树分析方法(FTA)
  13. 离散数学-自反性-对称性-传递性,关系的性质
  14. 基于vue的选择月日组件
  15. 机器视觉工业缺陷检测的那些事(四、常用算法与库)
  16. Discuznbsp;bbsnbsp;表结构字段含义详细分…
  17. 金融投资之重要财务指标 (From Corporate Finance, 6th Edition) 与Tushare数据接口
  18. 《操作系统真象还原》第十章
  19. 恶魔奶爸语法1-3课
  20. oracle数据库system01,system01坏块的问题

热门文章

  1. 52周存钱挑战4.0
  2. 前端js代码实现截图功能
  3. 【数据仓库-9】-- 数据仓库、数据集市和数据湖的区别
  4. python回调函数与eval函数
  5. Visual Basic 6.0.with.SP6 龙卷风大企业集成安装版(含下载地址)
  6. 【Go实战 | 电商平台】(7) 图片上传到七牛云
  7. (附源码)计算机毕业设计SSM火车票预定管理系统
  8. C++的左值(lvalue)和右值(rvalue)
  9. 怎样建网站能为后期工作提供有利条件
  10. 智慧交通指挥决策平台,让“城市大脑”尽收眼底