PAT(甲级)1042
2015-09-26 10:08
183 查看
1042. Shuffling Machine (20)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 <iostream>
#include <string>
#include <cstring>
using namespace std;
string str[55];
int order[55];
void transform(int order[],int k){
int a[55],res[55];
for(int i=1;i<55;i++)
a[i] = i;
while(k>=2){
for(int i=1;i<=54;i++){
res[order[i]] = a[i];
}
for(int i=1;i<=54;i++)
a[order[i]] = res[i];
k -=2;
}
if(k&0x1){
for(int i =1;i<=54;i++)
res[order[i]] = a[i];
for(int i=1;i<=54;i++)
order[i]= res[i];
}else
for(int i=1;i<=54;i++)
order[i] = a[i];
}
int main()
{
char str[55][5]={"","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"};
/* char (*p)[5] = str;
for(int i=1;i<=54;i++)
cout <<p[i] <<' ';
cout <<endl;*/
int K;
scanf("%d",&K);
for(int i=1;i<=54;i++){
scanf("%d",&order[i]);
}
transform(order,K);
for(int i=1;i<54;i++)
cout <<str[order[i]] <<' ';
cout <<str[order[54]] <<endl;
return 0;
}
相关文章推荐
- Android面试题
- HDU - 1069 Monkey and Banana(DAG)
- Linux通过编辑器vi使用介绍
- PAT(甲级)1041
- 网上看了篇文章关于多表连接的,感觉很好,记录下来,以便日后自己学习
- Struts2标签之bean
- 智能家居项目框架学习总结
- 虚拟机安装ubuntu
- Win7系统下运行英雄联盟提示error错误怎么办?运行英雄联盟提示error错误的解决方法
- 【TCO 2013 WildCard】SemiMultiple
- Linux Notes
- PAT(甲级)1040
- 如何完善链接
- c的free和c++的delete的区别
- 专业实训项目需求分析
- 【mongoDB基础篇②】PHP-mongo扩展的编译以及使用
- Python操作Redis之Incr
- Linux内核裁剪的具体步骤 http://blog.chinaunix.net/uid-10429687-id-3977273.html
- hdu2089
- 静态成员函数的作用与静态数据成员的初始化