PAT 1042. Shuffling Machine (20)
来源:互联网 发布:java遍历json 编辑:程序博客网 时间:2024/05/16 02:58
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.
/* * 按题目要求模拟洗牌过程。。不用google translate..我还真有点看不懂题干的背景描述。。 * 午睡操场传来蝉的声音 多少年后也还是很好听~~*/#include "iostream"#include "vector"#include "cstring"#include "string"#include "stack"#include "algorithm"using namespace std;int main() {int a[55], b[55], ori[55];int n;cin >> n;for (int i = 1; i <= 54; i++) {a[i] = i;cin >> ori[i];}for(int j=1; j<=n; j++) {for (int i = 1; i <= 54; i++)b[ori[i]] = a[i];for (int i = 1; i <= 54; i++)a[i] = b[i];}for (int i = 1; i <= 54; i++){if (b[i] <= 13) {cout << 'S' << b[i];}if (b[i] > 13 && b[i] <= 26) {cout << 'H' << b[i] - 13;}if (b[i] > 26 && b[i] <= 39) {cout << 'C' << b[i] - 26;}if (b[i] > 39 && b[i] <= 52) {cout << 'D' << b[i] - 39;}if (b[i] > 52 && b[i] <= 54) {cout << 'J' << b[i] - 52;}if(i!=54)cout << " ";}cout << endl;return 0;}
- 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)
- PAT 1042. Shuffling Machine
- 【PAT】1042. Shuffling Machine
- PAT-Shuffling Machine (20)
- PAT A 1042. Shuffling Machine (20)
- 【PAT (Advanced Level)】1042. Shuffling Machine (20)
- PAT甲级.1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20) PAT 甲级
- PAT(A) - 1042. Shuffling Machine (20)
- Java常见的几种排序算法-插入、选择、冒泡、快排、堆排等
- 一颗二叉查找树的简单实现
- c++智能指针(1)
- 微信小程序入门之构建一个简单TODOS应用
- 系统自检-FLASH自检
- PAT 1042. Shuffling Machine (20)
- 108-记录锁(继承与释放)
- tensorflow 函数接口的理解
- 有效括号
- Java多线程系列--“基础篇”03之 Thread中start()和run()的区别
- app语音聊天方案
- 关于游戏制作过程中遇到的几个问题记录
- Activity启动流程(源码分析)
- 赋值运算符函数