1042 Shuffling Machine（简单模拟）

这类题目几乎不需要数据结构，算法基础，主要通过简单的逻辑流程和判断实现。

题目描述如下：


题目大意：
先给出洗牌的次数k；接着给出每张卡片洗牌后所处的位置；经过k次洗牌后，输出每张卡片所处的位置。
大致思路：
可以用一个长度为54的字符串数组按照初始排序来存储54张牌，用另一个长度为54的字符串数组来接收洗牌后的卡牌编号，（每次洗牌在两个字符串数组中进行交换存储），一个长度为54的整数数组来存储输入。

提交结果如下：

代码如下：

#include<iostream>
#include<string>
using namespace std;
int main()
{
	string arr1[54] = { "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" };
	string arr2[54];
	int n;
	cin >> n;
	int arr[54];
	for (int i = 0; i < 54; i++)
	{
		int a;
		cin >> a;
		arr[i] = a;
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < 54; j++)
		{
			if (i % 2 == 0)
			{
				arr2[arr[j]-1] = arr1[j];
			}
			else
			{
				arr1[arr[j]-1] = arr2[j];
			}
		}
	}
	if (n % 2 == 0)
	{
		for (int i = 0; i < 53; i++)
			cout << arr1[i] << " ";
		cout << arr1[53] << endl;
	}
	else
	{
		for (int i = 0; i < 53; i++)
			cout << arr2[i] << " ";
		cout << arr2[53] << endl;
	}
}

本次提交后累计得分182，排名22726。