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.
Note：
如果遇上類似於洗牌這種數目很多的模擬題，先從小數目開始；
遇到字符串13並不是'0'+13得到的。
/************************************************
@ AUTHOR : GAOMINQUAN
@ DATA : 2014 - 2 - 24
@ MAIL : [email protected]
@ HARD : EASY ***
/************************************************/
#include<iostream>
#include<vector>
#include<string>
#include <algorithm>
using namespace std;
void initCards(vector<string> &cards){
int T = 4;
int M = 54;
int eachNum = 13;
string names[] = {"S","H","C","D","J"};
string ids[] = {"1","2","3","4","5","6","7","8","9","10","11","12","13"};
for(int tI = 0; tI<T; tI++){
for(int cI = 0; cI < eachNum; cI++){
string name = names[tI]+ids[cI];
cards.push_back(name);
}
}
cards.push_back("J1");
cards.push_back("J2");
}
int main(){
const int M = 54;
int N = 2;
cin>>N;
vector<string> cards;
initCards(cards);
//vector<int> list(M);
int list[M] = {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};
for(int listI = 0; listI < M; listI++){
cin>>list[listI];
}
while(N--){
vector<string> newCards(M);
for(int i = 0; i<M; i++){
int p = list[i]-1;
newCards[p] = cards[i];
}
for(int pIndex = 0; pIndex < M; pIndex++){
if(N==0){
cout<<newCards[pIndex];
if(pIndex!=M-1){
cout<<" ";
}
}
cards[pIndex] = newCards[pIndex];
}
}
return 0;
}
