1042 Shuffling Machine (20分)

简单模拟，每次新开一个矩阵，原扑克牌顺序，第i张牌放入新矩阵的第V[i]号，然后 更新一下扑克牌顺序，新顺序为 V

读题要仔细，先把题目的要求读明白，然后再把标准测试案例用笔分析一遍，最后再写代码。

附本人代码如下：

#include<iostream>
#include<string>
using namespace std;
int N,V[55];
string card[55] = { "","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 main() {
	string A[55];
	scanf("%d", &N);
	for (int i = 1; i < 55; i++) scanf("%d", &V[i]);
	for (int j = 0; j <N; j++) {
		for (int i = 1; i < 55; i++)A[V[i]] = card[i];
		for (int m = 1; m < 55; m++)card[m] = A[m];
	}
	printf("%s", card[1].c_str());
	for (int i = 2; i < 55; i++)printf(" %s", card[i].c_str());
	return 0;
}