自测题V——Shuffling Machine(20)

模拟洗牌程序，按照给定的次序，洗牌N遍。

寻找规律可以发现，我们只需要保存给定次序，使用tmpOrder[i]=order[tmpOrder[i]];进行嵌套即可。

由于粗心搞错次序，提交了6次才Pass.....

#include <iostream>
#include <string>
#define CARDNUM 54

using namespace std;

int main()
{
	int n, order[CARDNUM + 1], tmpOrder[CARDNUM + 1];	//两个数组，一个保存给定的顺序，另一个进行改变
	//直接赋值构造扑克牌
	string cards[CARDNUM] = { "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"}, tmp,result[CARDNUM];
	cin >> n;
	for (int i = 1; i <= CARDNUM; i++)
	{
		cin >> order[i];
		tmpOrder[i] = order[i];//同时给临时顺序赋值
	}
	while (--n)//洗牌n次
		for (int i = 1; i <= CARDNUM; i++)
			tmpOrder[i] = order[tmpOrder[i]];//获得下一次位置
	for (int i = 1; i <= CARDNUM; i++)
		result[tmpOrder[i] - 1] = cards[i - 1];//扑克牌排列结果
	for (int i = 0; i < CARDNUM-1; i++)//输出，注意结尾
		cout << result[i]<<" ";
	cout << result[CARDNUM - 1];
}