1042. Shuffling Machine (20)
2015-11-27 13:47
447 查看
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:
Sample Output:
---------------------华丽的分割线----------------------------
分析:可以用一个二维数组来轮流存变换的结果
代码:
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<cstdlib> #include<cstring> const char cards[55][4] = {"","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 output[2][55]; int input[55]; int main(void) { int N; scanf("%d\n",&N); int i,j; for(i=1;i<=54;++i) { scanf("%d",&input[i]); } for(i=1;i<=54;++i) { output[0][i] = i; } int result,pre; for(j=0;j<N;++j) { for(i=1;i<=54;++i) { pre = j % 2; result = (j+1) % 2; output[result][input[i]] = output[pre][i]; } } for(i=1;i<=54;++i) { printf("%s",cards[output[result][i]]); if(i!=54) printf(" "); } system("pause"); return 0; }
相关文章推荐
- 泡妞诀窍?找到妹子的需求,满足她!
- KVM性能测试和参考数据
- MYSQL IF NOT EXISTS AND IF EXISTS
- 【可持久化线段树】[SPOJ COT]Count on a tree
- 测透51汇编 51单片机所有程序(51学习的纪念)
- 动态姿态平衡分析
- OMPL138及U-Boot的启动过程分析(二)
- 木马藏身于系统进程中
- android应用性能测试之CPU和内存占用
- JVM详解链接地址
- 【Protobuf】
- mybatis 使用动态SQL
- Android toolbar添加SearchView混淆打包成功后访问出错
- js原型的理解之一切皆对象
- CSS定位
- [Android]打开eclipse报错:发现了以元素 'd:skin' 开头的无效内容。此处不应含有子元素。
- hadoop常见错误整理
- centos配置jdk
- 微信自定义推送模版消息
- JAVA多线程实现的三种方式