PAT-A-1042. Shuffling Machine (20)
来源:互联网 发布:rar解压软件官网 编辑:程序博客网 时间:2024/05/19 18:46
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
#include<iostream>#include<cstdio>using namespace std;const int maxn=60;char ch[5]={'S','H','C','D','J'};int a[maxn];int b[maxn];int change[maxn];int main(){ int n; cin>>n; for(int i=1;i<=54;i++) { cin>>change[i]; a[i]=i; } for(int i=0;i<n;i++) { for(int j=1;j<=54;j++) { int pos=change[j]; b[pos]=a[j]; } for(int j=1;j<=54;j++) a[j]=b[j]; } for(int i=1;i<=54;i++) { cout<<ch[(a[i]-1)/13]<<(a[i]-1)%13+1; if(i<54) cout<<" "; } system("pause"); return 0;}
- PAT A 1042. Shuffling Machine (20)
- PAT(A) - 1042. Shuffling Machine (20)
- PAT-A 1042. Shuffling Machine (20)
- PAT-A-1042. Shuffling Machine (20)
- PAT-A 1042. Shuffling Machine
- 1042. Shuffling Machine (20)-PAT
- 【PAT】1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine
- 【PAT】1042. Shuffling Machine
- PAT-Shuffling Machine (20)
- 计算机结构
- PAT乙级真题及训练集(19)--1021. 个位数统计 (15)
- Python 排序(sorted)
- FPGA综合系统设计(一):1.2/50μs冲击电压测量与显示
- Number Complement
- PAT-A-1042. Shuffling Machine (20)
- python爬虫之requests对https的限制访问
- 分布式session的解决方案
- 《简明Python教程》之异常
- UI基础
- CentOS7.3安装Go运行和开发环境
- 二分查找
- 第02课 03 JS中级课程-表格操作-3
- jquery学习网站分享