1042 Shuffling Machine

解题代码

#include<cstdio>
const int N = 54;
int start[N+1], next[N+1], end[N+1];
char map[5] = { 'S','H','C','D','J' };
int main()
{
	int num;
	scanf("%d", &num);
	for (int i = 1; i <= N; i++)
		start[i] = i;
	for (int i = 1; i <= N; i++)
		scanf("%d", &next[i]);
	for (int step = 1; step <= num; step++) {
		for (int i = 1; i <= N; i++)
			end[next[i]] = start[i];
		for (int i = 1; i <= N; i++)
			start[i] = end[i];
	}
	for (int i = 1; i <= N; i++) {
		if (i != 1) printf(" ");
		printf("%c%d", map[(start[i] - 1) / 13], (start[i] - 1) % 13 + 1);
	}
	return 0;
}

测试结果

问题整理

1.简单模拟。
2.少用花哨的函数，用最基本的数组往往不容易出bug，而且还精简。