1042. Shuffling Machine (20)
来源:互联网 发布:手机唱歌美声软件 编辑:程序博客网 时间:2024/06/05 14:51
题目链接:https://www.patest.cn/contests/pat-a-practise/1042
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
#include<cstdio>#include<cstring>int const N=54;char dig[][5]={"1","2","3","4","5","6","7","8","9","10","11","12","13"};char sign[][5]={"S","H","C","D"};char init[N][5];void initCards(){ for(int i=0;i<4;i++){ for(int j=0;j<13;j++){ strcat(init[13*i+j],sign[i]); strcat(init[13*i+j],dig[j]); } } strcpy(init[52],"J1"); strcpy(init[53],"J2");}int main(){ initCards(); int k,shuffle[N]; char res[N][5]; scanf("%d",&k); for(int i=0;i<54;i++){ scanf("%d",&shuffle[i]); } for(int t=0;t<k;t++){ for(int i=0;i<N;i++){ strcpy(res[shuffle[i]-1],init[i]); } for(int i=0;i<54;i++){ strcpy(init[i],res[i]); } } for(int i=0;i<N;i++){ if(i==0) printf("%s",res[i]); else printf(" %s",res[i]); } return 0; }
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- error deployer not found:github的解决方法
- 【算法导论】二进制运算技巧(持续添加)
- C# ArrayList的用法
- MATLAB图像入门
- 【S5PV210学习笔记】外插SD卡启动程序失败的解决办法
- 1042. Shuffling Machine (20)
- POJ 1191 棋盘分割 中文
- java web实现easyui树(第一版本)
- 论文笔记ImageNet Classification with Deep Convolutional Neural Networks(AlexNet)
- jquery上下切换滑动
- 1046. Shortest Distance (20)
- POJ 1192 最优连通子集 中文
- androidstudio获取SHA1和MD5
- Win7制作U盘启动盘