pat 1042. Shuffling Machine (20)
来源:互联网 发布:猎豹浏览器精简优化版 编辑:程序博客网 时间:2024/06/05 01:10
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: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
模拟, code from http://blog.csdn.net/jtjy568805874/article/details/50856664
#include <cstdio>#define inone(i) scanf("%d",&i)#define rep(i,j,k) for(int i=j;i<=k;i++)const int maxn = 54 + 2;int v[2][maxn], n, nt[maxn], now;void write(int x){if (x > 52) { printf("J%d", x - 52); return; }if (x > 39) { printf("D%d", x - 39); return; }if (x > 26) { printf("C%d", x - 26); return; }if (x > 13) { printf("H%d", x - 13); return; }printf("S%d", x); }int main(){inone(n);rep(i, 1, 54) scanf("%d", &nt[i]), v[now][i] = i;while (n--){rep(i, 1, 54) v[now ^ 1][nt[i]] = v[now][i];now ^= 1;}rep(i, 1, 54) {write(v[now][i]);printf("%s", i < 54 ? " " : "\n");} return 0;}
- 1042. Shuffling Machine (20)-PAT
- 【PAT】1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine
- 【PAT】1042. Shuffling Machine
- PAT-Shuffling Machine (20)
- PAT A 1042. Shuffling Machine (20)
- 【PAT (Advanced Level)】1042. Shuffling Machine (20)
- PAT甲级.1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20) PAT 甲级
- PAT(A) - 1042. Shuffling Machine (20)
- 不重复订单号生成的方法
- Cadence Allegro学习之板框创建与网表导入与器件布局
- python 建造者模式(实现,特点)
- 鸟哥的linux私房菜学习笔记《二十一》变量及环境变量详解
- spring参数校验,form表单形式,以及http接口形式
- pat 1042. Shuffling Machine (20)
- 《ACM程序设计》书中题目--problem u
- 转载 Unity GameCenter 接入
- 【数据分析】图书馆数据-03直方图展示借书数量与借书人数之间的关系
- java网络编程____httpclient工具类操作
- 在父页面中局部刷新子iframe
- 前端进阶---from表单---
- HTML5——网页绘画板
- CSDN文章中代码高亮显示