1042. Shuffling Machine (20)
2015-12-01 21:10
417 查看
1042. Shuffling Machine (20)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 <string>
#include <vector>
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
string num[] = {"0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13"};
vector<string> v1(55), v2(55);
for (int i = 1; i < 14; ++i) v1[i] = "S" + num[i];
for (int i = 14; i < 27; ++i) v1[i] = "H" + num[i - 13];
for (int i = 27; i < 40; ++i) v1[i] = "C" + num[i - 26];
for (int i = 40; i < 53; ++i) v1[i] = "D" + num[i - 39];
v1[53] = "J1", v1[54] = "J2";
int n;
int fp[55];
scanf("%d", &n);
for (int i = 1; i < 55; ++i) scanf("%d", fp + i);
while (n--) {
for (int i = 1; i < 55; ++i) {
v2[fp[i]] = v1[i];
}
v1.swap(v2);
}
for (int i = 1; i < 55; ++i) {
cout << v1[i];
if (i == 54) cout << '\n';
else cout << ' ';
}
return 0;
}
相关文章推荐
- 组合数学
- Grabcut
- +=与StringBuffer append
- 什么是情商——情商就是知道自己要干什么
- angular directive的使用
- android下播放器视频输出方法总结
- 2006 奇数乘积
- 多态的理解
- mysql权限角色管理
- ICP算法(Iterative Closest Point迭代最近点算法)
- C#中按钮响应事件简单或者相似响应函数的书写。
- Boot loader: Grub进阶[转]
- 最火的抓包工具winpcap使用教程
- .NET框架
- 华为,为什么让全世界都感到害怕?
- .NET框架
- leetcode- First Bad Version---简单
- 优秀不够,必须卓越,做一个不可替代的手艺人
- 版本控制器之-git的简单用法
- 《算法竞赛入门经典2ndEdition 》习题3-1 得分(Score, Uva1585)