Pat(Advanced Level)Practice--1042(Shuffling Machine)
来源:互联网 发布:淘宝货到付款卖家 编辑:程序博客网 时间:2024/05/19 23:27
Pat1042代码
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:236 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 47Sample 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
#include<cstdio>#include<cstdlib>#define MAX 55using namespace std;int main(int argc,char *argv[]){int card[MAX];int temp[MAX];int index[MAX];int i,k;scanf("%d",&k);for(i=1;i<=MAX-1;i++){scanf("%d",&index[i]);card[i]=i;}while(k--){for(i=1;i<=MAX-1;i++)temp[index[i]]=card[i];for(i=1;i<=MAX-1;i++)card[i]=temp[i];}for(i=1;i<=MAX-1;i++){int num=card[i]-1;if(i>1)printf(" ");switch(num/13){case 0:printf("S%d",num%13+1);break;case 1:printf("H%d",num%13+1);break;case 2:printf("C%d",num%13+1);break;case 3:printf("D%d",num%13+1);break;case 4:if(card[i]%13==1)printf("J1");elseprintf("J2");break;}}printf("\n");return 0;}
- Pat(Advanced Level)Practice--1042(Shuffling Machine)
- PAT (Advanced Level) Practise 1042 Shuffling Machine (20)
- PAT (Advanced Level) Practise 1042 Shuffling Machine (20)
- 【PAT (Advanced Level)】1042. Shuffling Machine (20)
- 【PAT】【Advanced Level】1042. Shuffling Machine (20)
- 【C++】PAT(advanced level)1042. Shuffling Machine (20)
- pat 1042 Shuffling Machine
- PAT (Advanced Level) 1042. Shuffling Machine (20) 洗牌机器,字符串替换
- 1042. Shuffling Machine (20)【模拟】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practice 1006
- Pat(Advanced Level)Practice--1025(PAT Ranking)
- Pat(Advanced Level)Practice--1075(PAT Judge)
- Pat(Advanced Level)Practice--1003(Emergency)
- Pat(Advanced Level)Practice--1004(Counting Leaves)
- Pat(Advanced Level)Practice--1008(Elevator)
- Pat(Advanced Level)Practice--1010(Radix)
- Pat(Advanced Level)Practice--1015(Reversible Primes)
- Pat(Advanced Level)Practice--1024(Palindromic Number)
- 使用希捷DiscWizard格式化3TB硬盘并分区
- 聆听沉默 (愿与君共勉)
- 工程思维与中国人情社会 (一)
- 桥接模式
- 02-08格式检查
- Pat(Advanced Level)Practice--1042(Shuffling Machine)
- Qt-Qlabel 自定义鼠标点击事件以及文本样式效果设计
- Windows/Ubuntu下Eclipse的AVD不能启动解决技巧
- 1879: Intersection
- js异步加载的三种解决方案
- 实验十六_编写包含多个功能子程序的中断例程
- java.net 类 URL
- ios第三档库
- Linux 命令详解 -- join