瑞神HRZ因为疫情在家闲得无聊,同时他又非常厉害,所有的课对他来说都是水一水就能拿A+,所以他无聊,找来了另外三个人:咕咕东,腾神以及zjm来打牌(天下苦瑞神久矣)。
显然,牌局由四个人构成,围成一圈。我们称四个方向为北 东 南 西。对应的英文是North,East,South,West。游戏一共由一副扑克,也就是52张构成。开始,我们指定一位发牌员(东南西北中的一个,用英文首字母标识)开始发牌,发牌顺序为顺时针,发牌员第一个不发自己,而是发他的下一个人(顺时针的下一个人)。这样,每个人都会拿到13张牌。
现在我们定义牌的顺序,首先,花色是(梅花)<(方片)<(黑桃)<(红桃),(输入时,我们用C,D,S,H分别表示梅花,方片,黑桃,红桃,即其单词首字母)。对于牌面的值,我们规定2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < T < J < Q < K < A。
现在你作为上帝,你要从小到大排序每个人手中的牌,并按照给定格式输出。(具体格式见输出描述和样例输出)。
Input
输入包含多组数据
每组数据的第一行包含一个大写字符,表示发牌员是谁。如果该字符为‘#’则表示输入结束。
接下来有两行,每行有52个字符,表示了26张牌,两行加起来一共52张牌。每张牌都由两个字符组成,第一个字符表示花色,第二个字符表示数值
Output
输出多组数据发牌的结果,每组数据之后需要额外多输出一个空行!!!!!
每组数据应该由24行的组成,输出按照顺时针方向,始终先输出South Player的结果,每位玩家先输出一行即玩家名称(东南西北),接下来五行,第一行和第五行输出固定格式(见样例),第二行和第四行按顺序和格式输出数值(见样例),第三行按顺序和格式输出花色(见样例)。
Sample Input
N
CTCAH8CJD4C6D9SQC7S5HAD2HJH9CKD3H6D6D7H3HQH4C5DKHKS9
SJDTS3S7S4C4CQHTSAH2D8DJSTSKS2H5D5DQDAH7C9S8C8S6C2C3
#
Sample Output
South player:
+---+---+---+---+---+---+---+---+---+---+---+---+---+
|6 6|A A|6 6|J J|5 5|6 6|7 7|9 9|4 4|5 5|7 7|9 9|T T|
| C | C | D | D | S | S | S | S | H | H | H | H | H |
|6 6|A A|6 6|J J|5 5|6 6|7 7|9 9|4 4|5 5|7 7|9 9|T T|
+---+---+---+---+---+---+---+---+---+---+---+---+---+
West player:
+---+---+---+---+---+---+---+---+---+---+---+---+---+
|2 2|5 5|9 9|K K|5 5|7 7|9 9|4 4|T T|J J|A A|8 8|A A|
| C | C | C | C | D | D | D | S | S | S | S | H | H |
|2 2|5 5|9 9|K K|5 5|7 7|9 9|4 4|T T|J J|A A|8 8|A A|
+---+---+---+---+---+---+---+---+---+---+---+---+---+
North player:
+---+---+---+---+---+---+---+---+---+---+---+---+---+
|3 3|4 4|J J|2 2|3 3|T T|Q Q|K K|8 8|Q Q|K K|2 2|3 3|
| C | C | C | D | D | D | D | D | S | S | S | H | H |
|3 3|4 4|J J|2 2|3 3|T T|Q Q|K K|8 8|Q Q|K K|2 2|3 3|
+---+---+---+---+---+---+---+---+---+---+---+---+---+
East player:
+---+---+---+---+---+---+---+---+---+---+---+---+---+
|7 7|8 8|T T|Q Q|4 4|8 8|A A|2 2|3 3|6 6|J J|Q Q|K K|
| C | C | C | C | D | D | D | S | S | H | H | H | H |
|7 7|8 8|T T|Q Q|4 4|8 8|A A|2 2|3 3|6 6|J J|Q Q|K K|
+---+---+---+---+---+---+---+---+---+---+---+---+---+
代码关键部分(结构体排序的基础上套了一个map即可按照题目要求的进行排序)
struct card
{
char color;
char value;
bool operator < (const card & s) const
{
if (color!=s.color) return ch_hua[color] < ch_hua[s.color];
else return ch_val[value] < ch_val[s.value];
}
};
全部代码(qaq忽略大篇幅的输出balabala)
#include<iostream>
#include<map>
#include<string>
#include<algorithm>
using namespace std;
map<char,int> ch_hua;
map<char,int> ch_val;
struct card
{
char color;
char value;
bool operator < (const card & s) const
{
if (color!=s.color) return ch_hua[color] < ch_hua[s.color];
else return ch_val[value] < ch_val[s.value];
}
};
card puke [4][13];
void output(char dir)
{
if(dir=='E')
{
for(int i=0;i<4;i++)
{
if(i==0)
cout<<"South player:"<<endl;
else if(i==1)
cout<<"West player:"<<endl;
else if(i==2)
cout<<"North player:"<<endl;
else
cout<<"East player:"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"| "<<puke[i][j].color<<" ";
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
}
}
if(dir=='S')
{
cout<<"South player:"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[3][j].value<<" "<<puke[3][j].value;
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"| "<<puke[3][j].color<<" ";
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[3][j].value<<" "<<puke[3][j].value;
cout<<"|"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int i=0;i<3;i++)
{
if(i==0)
cout<<"West player:"<<endl;
else if(i==1)
cout<<"North player:"<<endl;
else
cout<<"East player:"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"| "<<puke[i][j].color<<" ";
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
}
}
if(dir=='W')
{
for(int i=2;i<4;i++)
{
if(i==2)
cout<<"South player:"<<endl;
else
cout<<"West player:"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"| "<<puke[i][j].color<<" ";
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
}
for(int i=0;i<2;i++)
{
if(i==0)
cout<<"North player:"<<endl;
else
cout<<"East player:"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"| "<<puke[i][j].color<<" ";
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
}
}
if(dir=='N')
{
for(int i=1;i<4;i++)
{
if(i==1)
cout<<"South player:"<<endl;
else if(i==2)
cout<<"West player:"<<endl;
else
cout<<"North player:"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"| "<<puke[i][j].color<<" ";
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[i][j].value<<" "<<puke[i][j].value;
cout<<"|"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
}
cout<<"East player:"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[0][j].value<<" "<<puke[0][j].value;
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"| "<<puke[0][j].color<<" ";
cout<<"|"<<endl;
for(int j=0;j<13;j++)
cout<<"|"<<puke[0][j].value<<" "<<puke[0][j].value;
cout<<"|"<<endl;
cout<<"+---+---+---+---+---+---+---+---+---+---+---+---+---+"<<endl;
}
}
//顺时针 south west north east
int main()
{
ch_hua['C'] = 1;
ch_hua['D'] = 2;
ch_hua['S'] = 3;
ch_hua['H'] = 4;
ch_val['2'] = 1;
ch_val['3'] = 2;
ch_val['4'] = 3;
ch_val['5'] = 4;
ch_val['6'] = 5;
ch_val['7'] = 6;
ch_val['8'] = 7;
ch_val['9'] = 8;
ch_val['T'] = 9;
ch_val['J'] = 10;
ch_val['Q'] = 11;
ch_val['K'] = 12;
ch_val['A'] = 13;
char direction;
while(cin>>direction)
{
if(direction=='#') break;
for(int i=0;i<13;i++)
for(int j=0;j<4;j++)
cin>>puke[j][i].color>>puke[j][i].value;
for(int i=0;i<4;i++)
sort(&puke[i][0],&puke[i][0]+13);
output(direction);
cout<<endl;
}
return 0;
}
代码运行结果