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:

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 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

---

提交代码

题目意思：

有五十四张牌编号1-54，按初始编号从大到小排列，另外牌给定了花色，从左到右S、H、C、D各十三张，J两张。接下来执行一种操作，改变拍的位置，比如五张牌S3，H5，C1，D13,J2然后执行操作{4,2,5,3,1}，把S3放到了4号位置，H5放到了2号位置，后面同理。得到了J2,H5,D13,S3,C1。再执行一次得到C1,H5,S3,J2,D13。

解题思路：

定义三个数组，一个start数组，存放没交换之前的数据，一个end数组存放交换之后的数据，一个next数组，存放每张牌需要放到的位置。最开始的时候start[i]=i;交换的时候只需要end[next[i]]=start[i]即可完成交换，交换之后在更新start数组，因为下次交换的start数组是上一次交换得到的数组。最后输出的时候要先进行牌的值减去1再%13然后再加上一，如果不这样有些牌将会得不到。

#include<stdio.h>#define N 54int start[N+5],end[N+5],next[N+5];char map[5] = {'S','H','C','D','J'};int main(){//freopen("input.txt","r",stdin);int ncase;scanf("%d",&ncase);for(int i = 1;i <= N;i++){scanf("%d",&next[i]);}for(int i = 1;i <= N;i++){start[i] = i;}while(ncase--){for(int i = 1;i <= N;i++){end[next[i]] = start[i];}for(int i = 1;i <= N;i++){start[i] = end[i];}}for(int i = 1;i <= N;i++){start[i]--;printf("%c%d",map[start[i]/13],start[i]%13 +1);if(i != N){printf(" ");}else{printf("\n");}}}