PAT甲级 1042
来源:互联网 发布:如何编写js插件 编辑:程序博客网 时间:2024/06/05 18:43
Shuffling Machine
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 <iostream>#include <vector>#include <stdio.h>using namespace std;int cards[55];int shuff[55];int order[55];int main(){ freopen("./in.cpp","r",stdin); int i,j; int times; scanf("%d",×); for(i=1;i<55;i++)scanf("%d",order+i); for(i=1;i<55;i++)cards[i]=i; for(i=0;i<times;i++){ for(j=1;j<55;j++){ shuff[order[j]]=cards[j]; } for(j=1;j<55;j++){ cards[j]=shuff[j]; // } } char kinds[5]={'S','H','C','D','J'}; printf("%c%d",kinds[(cards[1]-1)/13],cards[1]%13==0?13:cards[1]%13); for(i=2;i<55;i++){ printf(" %c%d",kinds[(cards[i]-1)/13],cards[i]%13==0?13:cards[i]%13); } return 0;}
- PAT(甲级)1042
- 浙大PAT甲级 1042
- PAT甲级1042
- PAT甲级 1042
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- POJ-1330 Nearest Common Ancestors(lca模板题)
- mysql-Can\'t connect to MySQL server on \'127.0.0.1\' (10061) (code 2003)"): error calling Python mo
- 对map集合进行排序
- 职业性格
- 写代码怎能不会这些 Linux 命令?
- PAT甲级 1042
- HTML5 离线缓存 Web Workr
- Spring Boot -- 微信企业号开发03-aes解密失败
- getviewtype()实现recyclerview分组
- LINUX驱动之SPI子系统之一概述
- Android LayoutInflater原理分析,带你一步步深入了解View(一)
- CSAPP3e-第二章Homework
- HTML5 拖放
- 首字母大写