Shuffling Machine（洗牌机问题）

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.

题目大意为：先给定的顺序是[1,54]中不同整数的排列。如果第i个位置的数字是j，这意味着将牌从位置i移动到位置j。例如，假设我们只有5张牌:S3, H5, C1, D13和J2。给定一个洗牌顺序[4,2,5,3,1]，结果将是:J2, H5, D13, S3, C1。如果我们再次重复洗牌，结果将是:C1, H5, S3, J2, D13。

样例：

输入：

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

输出： 

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

 解题思路：这题其实就是输出洗牌过后的的结果a[1...n ]，所以我们想办法得到洗过之后的a[1]被a[?]替代了就可以了。所以问题就转化成了求得洗过n遍之后下标为？的代替了原有位置即可。也就是探讨下标之间的相互替代。如题中例：S3,H5,C1,D13,J2,对应位置为1，2，3，4，5，经过变化顺序[4,2,5,3,1]洗过一次后1的位置被5替代，对应依次为2->2,3->4,4->1,5->3替换，所以直接输出对应a[5]，a[2]，a[4]，a[1]，a[3]即可。

for (int i = 1; i <= 54; i++) {
		cin >> b[i];//规定的变换顺序
	}

for(int i = 1; i <= 54; i++) {
		first[i] = i;//记录洗牌前的顺序
	}

---

要记录一个替换前的顺序qian[ ]，还需要知道替换后的顺序first[ ]，所有的都替换完，first[ ]即变成了所谓的替换前的顺序，所以每次都需要qian[f] = first[f];

for (int f = 1; f <= 54; f++) {
			  qian[f] = first[f];
		}

---

一个序列从1~54，从1开始，看变换顺序中b[?]==1,即对应把此位置对应的数qian[g]变换到1的位置，即first[1]=qian[g]

for (int k = 1; k <= 54; k++) {
			for ( g = 1; g <= 54; g++) {
				if (k == b[g])
					break;
			}
			first[k] = qian[g];
		}

---

完整代码：

#include<bits/stdc++.h>

using namespace std;

int main() {
	int n;
	int first[55],g[55],qian[55],k;
	const char* a[55] = { "\0","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" };
	cin >> n;
	for (int o = 1; o <= 54; o++) {
		cin >> g[o];//规定的变换顺序
	}
	for (int i = 1; i <= 54; i++) {
		first[i] = i;//最初顺序
	}
	
	for (int i = 1; i <= n; i++) {//循环次数
		for (int h = 1; h <= 54; h++) {
			qian[h] = first[h];
		}
		for (int j = 1; j <= 54; j++) {
			for (k = 1; k <= 54; k++) {
				if (g[k]==j)
					break;
			}
			first[j] = qian[k];
		}
	}
	for (int i = 1; i <= 54; i++) {
		if (i == 1)
			cout << a[first[i]];
		else
			cout << " " << a[first[i]];
	}
	return 0;
}