PAT A1042
来源:互联网 发布:淘宝宝贝重量属性 编辑:程序博客网 时间:2024/06/05 03:38
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 employautomatic 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
实现代码如下:
#include <iostream>#include<map>using namespace std;int main(){ string cards[54]={ "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"}; string cards1[54]; int k, index[54]; cin>>k; for(int i = 0; i < 54; i++) cin>>index[i]; while(k--) { for(int i = 0; i < 54; i++) cards1[index[i] - 1] = cards[i]; for(int i = 0; i < 54; i++) cards[i] = cards1[i]; } for(int i = 0; i < 53; i++) cout<<cards[i]<<' '; cout<<cards[53];}
- PAT A1042
- pat a1042
- PAT-A1042
- PAT A1042 Shuffing Machine
- PAT A1042 Shuffling Machine
- PAT A1042.Shuffling Machine
- PAT a1042题解
- PAT A1042. Shuffling Machine (20)
- PAT A1042 Shuffling Machine (20)
- 【PAT】A1042. Shuffling Machine (20)
- PAT---A1042 Shuffling Machine (20)
- PAT A1042. Shuffling Machine (20)
- PAT A1042. Shuffling Machine (20)
- PAT-A1042 Shuffling Machine(简单模拟)
- A1042 Shuffling Machine
- A1042. Shuffling Machine (20)
- Tsinsen-A1042-矩阵面积交
- A1042. Shuffling Machine(洗牌机)
- Source Insight 乱码问题全解决。
- DrawerLayout的使用
- 缓冲输入字符流
- expdp\impdp network用法
- S6.6_Struts2_I18n 项目如何实现国际化 I18n
- PAT A1042
- Google Protocol Buffer 的使用和原理
- Centos7使用网络管理添加DSL(pppoe)拨号上网
- IntelliJ IDEA清空项目缓存
- Java语言基础(三)—— 注释
- 二维数组的计算
- 《商业银行会计》--概述
- 文件操作工具类FileUtils
- 局部自适应阈值二值化cvAdaptiveThreshold