1042. Shuffling Machine (20)
来源:互联网 发布:淘宝网上代购可信吗 编辑:程序博客网 时间:2024/06/06 03:57
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.
#include <stdio.h>int main(){int n,i,j; char s[55][4] = { "00","S1", "S2", "S3","S4","S5","S6","S7","S8","S9","S10","S11","S12", "S13","H1", "H2", "H3", "H4", "H5", "H6", "H7", "H8", "H9", "H10", "H11", "H12", "H13","C1", "C2", "C3", "C4", "C5", "C6", "C7", "C8", "C9", "C10", "C11", "C12", "C13","D1", "D2", "D3", "D4", "D5", "D6", "D7", "D8", "D9", "D10", "D11", "D12", "D13","J1", "J2" };int a[55],b[55],c[55]; //a存储未洗的,b存储一次洗牌后的,c存储洗牌方式scanf("%d",&n);for(i=1;i<=54;i++) //完成a初始化{a[i] = i;}for(i=1;i<=54;i++) //读入洗牌方式{scanf("%d",&c[i]);}for(i=0;i<n;i++) //完成n次洗牌{for(j=1;j<=54;j++){b[c[j]] = a[j]; }for(j=1;j<=54;j++){a[j] = b[j];}}for(j=1;j<54;j++) //输出{printf("%s ",s[b[j]]);}printf("%s",s[b[j]]);return 0;}
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)
- iOS Scrollview 的头部view的拉伸伸缩效果
- 五分钟学会之contentprovider
- 函数指针及其运用
- freopen ()函数
- R语言的plyr包简介
- 1042. Shuffling Machine (20)
- 解析HTML中的float和margin的疑惑
- cpu caffe cifar10 ubuntu 14.04 python
- 生成器模式(Builder)
- linux下进行c/c++开发
- C#控制台 通过getlength函数得到一个二维数组的行与列
- python学习笔记(1)_关于IDLE
- 管理 Java 类路径 (Windows)
- C#控制台 初始化交错数组