pat1042. Shuffling Machine (20)
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了pat1042. Shuffling Machine (20),小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含2883字,纯文字阅读大概需要5分钟。
内容图文
![pat1042. Shuffling Machine (20)](/upload/InfoBanner/zyjiaocheng/1335/04688e202dba4392bfb7b6ebc791468c.jpg)
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 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
1 #include<cstdio> 2 #include<stack> 3 #include<algorithm> 4 #include<iostream> 5 #include<stack> 6 #include<set> 7 #include<map> 8usingnamespace std; 9int order[55],temp[55],fina[55]; 10char fir[5]={‘S‘,‘H‘,‘C‘,‘D‘,‘J‘}; 11int main(){ 12//freopen("D:\\INPUT.txt","r",stdin);13int n,i,j,k; 14 scanf("%d",&n); 15for(i=1;i<=54;i++){ 16 scanf("%d",&order[i]); 17 fina[i]=i; 18 } 19while(n--){ 20for(i=1;i<=54;i++){ 21 temp[order[i]]=fina[i]; 22 } 23for(i=1;i<=54;i++){ 24 fina[i]=temp[i]; 25 } 26 } 27 cout<<fir[(fina[1]-1)/13]; 28 printf("%d",fina[1]%13==0?13:fina[1]%13); 29for(i=2;i<=54;i++){ 30 cout<<""<<fir[(fina[i]-1)/13]; 31 printf("%d",fina[i]%13==0?13:fina[i]%13); 32 } 33 printf("\n"); 34return0; 35 }
原文:http://www.cnblogs.com/Deribs4/p/4783063.html
内容总结
以上是互联网集市为您收集整理的pat1042. Shuffling Machine (20)全部内容,希望文章能够帮你解决pat1042. Shuffling Machine (20)所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。