【PAT (Advanced Level)】1042. Shuffling Machine (20)
来源:互联网 发布:c语言自学难吗 编辑:程序博客网 时间:2024/06/05 06:17
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 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 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
理解题目意思就很好做,就是做N次交换,把 i 放到 j 的位置上去,用几个数组就可以了;
代码如下:
/************************************This is a test program for anythingEnjoy IT!************************************/#include <iostream>#include <iomanip>#include <algorithm>#include <vector>#include <list>#include <set>#include <fstream>#include <string>#include <cmath>using namespace std;int main(){ifstream cin;cin.open("in.txt");ofstream cout;cout.open("out.txt");//////////////////////////////////////////////////////////////////////////// TO DO Whatever You WANT!int n;while (cin >> n){int card[54] = { 0 }, order[54] = { 0 }, rst[54] = { 0 };for (int i = 0; i < 54; i++){cin >> order[i];card[i] = i;}for (int i = 0; i < n; i++){for (int j = 0; j < 54; j++){rst[order[j] - 1] = card[j];}for (int j = 0; j < 54; j++){card[j] = rst[j];}}for (int i = 0; i < 54; i++){if (i != 0) cout << " ";switch (rst[i] / 13){case 0:cout << 'S';break;case 1:cout << 'H';break;case 2:cout << 'C';break;case 3:cout << 'D';break;case 4:cout << 'J';break;}cout << rst[i] % 13 + 1;}cout << endl;}//////////////////////////////////////////////////////////////////////////// system("pause");return 0;}
- 【PAT (Advanced Level)】1042. Shuffling Machine (20)
- 【PAT】【Advanced Level】1042. Shuffling Machine (20)
- 【C++】PAT(advanced level)1042. Shuffling Machine (20)
- PAT (Advanced Level) Practise 1042 Shuffling Machine (20)
- PAT (Advanced Level) Practise 1042 Shuffling Machine (20)
- Pat(Advanced Level)Practice--1042(Shuffling Machine)
- PAT (Advanced Level) 1042. Shuffling Machine (20) 洗牌机器,字符串替换
- 1042. Shuffling Machine (20)【模拟】——PAT (Advanced Level) Practise
- 1042. Shuffling Machine (20)-PAT
- 【PAT】1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- 输入输出-保护继承
- 图解HTTPS
- 我说李敖
- (一)8天快速掌握Android视频教程_前言
- Android的Log捕获与有效性验证及异常初步分析
- 【PAT (Advanced Level)】1042. Shuffling Machine (20)
- 代码中获取hibernate 方言的方式
- iOS框架引见--Core Services 层
- Android 关于在ScrollView中加上一个ListView,ListView内容显示不完全(总是显示第一项)的问题的两种简单的解决方案
- UVACO401
- linux下tomcat shutdown后 java进程依旧存在 -- 阿里MetaQ篇
- 宝宝好736B BB手推车 婴儿车夏 婴儿推车可躺 送蚊帐音乐盒
- 韩顺平PHP学习视频笔记整理005无序列表 有序列表 框架
- 你听说过XML吗?