Shuffling Machine
7-43 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:
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
提示:K和how to shuffling都必须全部读掉。也就是说就算洗牌次数是0次也要输入洗牌顺序。
#include <stdio.h> typedef struct _card {
char letter;
int num;
} Card; void init(Card ca[]);
void print(Card ca[]); int main(int argc, char const *argv[])
{
Card ca[], cb[];
int order[];
int k; init(ca); scanf("%d", &k); // how to shuffling
for ( int i = ; i < ; i++ ) {
scanf("%d", &order[i]);
}
// shuffling
for ( int i = ; i < k; i++ ) {
for ( int j = ; j < ; j++ ) {
cb[order[j]-] = ca[j];
}
for ( int j = ; j < ; j++ ) {
ca[j] = cb[j];
}
} print(ca); return ;
} void init(Card ca[])
{
char a[] = "SHCDJ";
int i;
for ( i = ; i < ; i++ ) {
ca[i].letter = a[i/];
ca[i].num = i%+;
}
} void print(Card ca[])
{
for ( int i = ; i < ; i++ ) {
printf("%c%d", ca[i].letter, ca[i].num);
if ( i < )
printf(" ");
}
printf("\n");
}
最新文章
- Eclipse调试Android App若选择&ldquo;Use same device for future launches&rdquo;就再也无法选择其他设备的问题
- Java NIO工作原理
- jsonpath
- 异步任务神器 Celery 简明笔记
- Count and Say [LeetCode 38]
- B - Kefa and Company
- A Tour of Go Range continued
- 转:Google论文之三----MapReduce
- 一步一步学习SignalR进行实时通信_2_Persistent Connections
- LightOJ 1033 Generating Palindromes(dp)
- NOIP2009T3最优贸易
- Hybrid App开发之jQuery基础
- ZOJ 3777-Problem Arrangement(状压DP)
- poj:4091:The Closest M Points
- Collections.synchronizedMap()、ConcurrentHashMap、Hashtable之间的区别
- Flink监控:Monitoring Apache Flink Applications
- jQuery中.html(“xxx”)和.append(";xxx";) 的区别
- http笔记汇总
- Zepto学习笔记
- 虚拟机开启Linux时出现“我以复制虚拟机”、“我已移动虚拟机”