# 1042. Shuffling Machine (20)

400 ms

32000 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 3132 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<stdio.h>
int a[55]={0};
int b[55]={0};
int c[55]={0};
char d[6]={' ','S','H','C','D','J'};
/*简单的模拟题*/
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=1;i<=54;i++)
{
scanf("%d",&b[i]);
a[i]=i;
}

for(j=0;j<n;j++)
{
for(i=1;i<=54;i++)
c[b[i]]=a[i];
for(i=1;i<=54;i++)
a[i]=c[i];
}

for(i=1;i<=53;i++)
printf("%c%d ",d[(c[i]+12)/13],(c[i]+12)%13+1);
printf("%c%d",d[(c[i]+12)/13],(c[i]+12)%13+1);
return 0;
}

66 篇文章34 人订阅

0 条评论

## 相关文章

13930

### Cats（3）－ freeK-Free编程更轻松，Free programming with freeK

在上一节我们讨论了通过Coproduct来实现DSL组合：用一些功能简单的基础DSL组合成符合大型多复杂功能应用的DSL。但是我们发现：cats在处理多层...

21470

18220

### FZU 2099 魔法阵（计算几何）

Problem 2099 魔法阵 Accept: 120    Submit: 289 Time Limit: 1000 mSec    Memory L...

29330

30150

8510

31290

### 1751: [Usaco2005 qua]Lake Counting

1751: [Usaco2005 qua]Lake Counting Time Limit: 5 Sec  Memory Limit: 64 MB Submit...

33260

### 聊聊rocketmq的PushConsumerImpl

io/openmessaging/rocketmq/consumer/PushConsumerImpl.java

19720

### Leetcode 150 Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation. Val...

211100