题意:根据一个特定的洗牌序列,对一副牌洗n次,求洗完牌后的牌序
注意点:水题,但是要注意 输入的序列是1~54,而我们数组的下标是0~53!
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<stack>
#include<vector>
#include<queue>
#include<string>
#include<map>
using namespace std;
#define INF 99999999
#define M 300
void shuff(vector<int> &oldcard,vector<int> &newcard,vector<int> shlist)
{
int i;
for(i = 0; i< 54;i++)
{
newcard[shlist[i]-1] = oldcard[i]; //不要忘记减一!
}
oldcard = newcard;
}
void printcard(vector<int> newcard)
{
char c;
int num;
int i;
for(i=0;i<54;i++)
{
c = newcard[i]/13;
switch(c)
{
case 0:c='S';break;
case 1:c='H';break;
case 2:c='C';break;
case 3:c='D';break;
case 4:c='J';break;
}
num = newcard[i]%13+1;
printf("%c%d",c,num);
if(i!=53)
printf(" ");
else cout<<endl;
}
}
//start 21:46
//end 22:05
int main(){
int i,k,n;
vector<int> newcard,oldcard,shlist;
for(i=0;i<54;i++)
{
oldcard.push_back(i);
}
newcard = oldcard;
scanf("%d",&n);
int card;
for(i=0;i<54;i++)
{
scanf("%d",&card);
shlist.push_back(card);
}
while(n--)
{
shuff(oldcard,newcard,shlist);
}
printcard(newcard);
}