1042 Shuffling Machine-CSDN博客

本文链接：https://blog.csdn.net/hlp_whale/article/details/128792561

1042 Shuffling Machine

题目大意

将扑克牌按照给定的顺序，转换个几次就ok

算法思想

可以写两个数组，分别为旧新数组，每次洗完排后，都得把新牌赋到旧牌上

代码

#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int>seq(55);
vector<string>oldcard(55);
vector<string>newcard(55);
void shuffling() {//洗牌
	for (int i = 1; i <= 54; i++) {
		newcard[seq[i]] = oldcard[i];
	}
	return;
}
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= 54; i++) {//初始化，不想一个一个附上去
		cin >> seq[i];
		if (i >= 1 && i <= 13)
			oldcard[i] = "S" + to_string(i);
		else if (i >= 14 && i <= 26)
			oldcard[i] = "H" + to_string(i - 13);
		else if (i >= 27 && i <= 39)
			oldcard[i] = "C" + to_string(i - 26);
		else if (i >= 40 && i <= 52)
			oldcard[i] = "D" + to_string(i - 39);
		else
			oldcard[i] = "J" + to_string(i - 52);
	}
	for (int i = 0; i < n; i++)//洗牌
	{
		shuffling();
		oldcard = newcard;//更新旧牌
	}
	cout << newcard[1];
	for (int i = 2; i <= 54; i++)
		cout << " " << newcard[i];
	return 0;
}