#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct node
{
char k = 0;
int num = 0;
int mark = 0;
};
struct node l[54];
int a[54];
bool cmp(node a,node b)
{
return a.mark<b.mark;
}
int main()
{
memset(a,0,sizeof(a));
for(int i=0;i<13;i++)
{
l[i].num = i+1;
l[i].k = 'S';
}
for(int i=13;i<26;i++)
{
l[i].num = i-12;
l[i].k = 'H';
}
for(int i=26;i<39;i++)
{
l[i].num = i-25;
l[i].k = 'C';
}
for(int i=39;i<52;i++)
{
l[i].num = i-38;
l[i].k = 'D';
}
l[52].num =1;l[52].k = 'J';
l[53].num = 2;l[53].k = 'J';
int n;
cin>>n;
for(int i =0;i<54;i++ )
{
cin>>a[i];
l[i].mark = a[i];
}
for(int i = 0;i<n;i++)
{
sort(l,l+54,cmp);
for(int i = 0;i<54;i++)l[i].mark = a[i];
}
for(int i =0;i<53;i++)cout<<l[i].k<<l[i].num<<" ";
cout<<l[53].k<<l[53].num;
return 0;
}
PAT甲级 1042 Shuffling Machine
最新推荐文章于 2024-02-17 12:34:34 发布