PAT A1042.Shuffling Machine
来源:互联网 发布:115网络异常请重试 编辑:程序博客网 时间:2024/05/29 11:41
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
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<cstdio>#include<iostream>using namespace std;int main() {char hs[5] = { 'S','H','C','D','J' };int start[54], next[54], end[54],n;cin >> n;for (int i = 0; i < 54; i++)start[i] = i + 1;for (int i = 0; i < 54; i++)cin >> next[i];for (int i = 0; i < n; i++) {for (int i = 0; i < 54; i++)end[next[i] - 1] = start[i];for (int i = 0; i < 54; i++)start[i] = end[i];}for (int i = 0; i < 54; i++) {cout << hs[(end[i] - 1) / 13] <<(end[i] - 1) % 13 + 1;if (i != 53)cout << " ";}return 0;}//此题没啥要点,只是要注意输出时的位置关系
阅读全文
0 0
- PAT A1042 Shuffling Machine
- PAT A1042.Shuffling Machine
- 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)
- A1042. Shuffling Machine(洗牌机)
- PAT A1042 Shuffing Machine
- 3.1入门模拟A1042. Shuffling Machine (20)
- pat 1042 Shuffling Machine
- PAT 1042. Shuffling Machine
- PAT Shuffling machine (Python)
- PAT-Shuffling Machine (20)
- php+redis实现电商秒杀功能
- 生成四位数的验证码---> 验证码要求由 0-9 .a-z A-Z组成
- 自我对冒泡排序以及对快速排序的理解
- Jenkins+maven+git+ubuntu 环境搭建
- PHP 自定义错误日志
- PAT A1042.Shuffling Machine
- CentOS下mysql数据库常用命令总结
- CentOS7.0使用yum安装MySQL及使用遇到的问题
- 用sklearn绘制ROC曲线
- 如何写安全性的接口
- @Import注解
- laravel引入jquery
- baby-gin 算法
- linux主从同步