题目
牌局由四个人构成,围成一圈。我们称四个方向为北 东 南 西。对应的英文是North,East,South,West。游戏一共由一副扑克,也就是52张构成。开始,我们指定一位发牌员(东南西北中的一个,用英文首字母标识)开始发牌,发牌顺序为顺时针,发牌员第一个不发自己,而是发他的下一个人(顺时针的下一个人)。这样,每个人都会拿到13张牌。
现在我们定义牌的顺序,首先,花色是(梅花)<(方片)<(黑桃)<(红桃),(输入时,我们用C,D,S,H分别表示梅花,方片,黑桃,红桃,即其单词首字母)。对于牌面的值,我们规定2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < T < J < Q < K < A。
现在你作为上帝,你要从小到大排序每个人手中的牌,并按照给定格式输出。(具体格式见输出描述和样例输出)。
解题思路
为提高数据处理速率,首先将本次所有输入用 scanf 读取到字符串中,再对字符串进行数据加工。为了处理方便,四个方向 北 东 南 西 分别用整数 0 1 2 3 表示。
玩家手上的第 i 张牌的花色和牌面分别用数组 L[2i] L[2i+1] (L=N,E,S,W) 来表示。读取玩家的牌,从发牌员的下一位开始,玩家顺序已经存储在字符串数组 D[4] 中,每要轮到下一位玩家时,就将当前玩家序号加 1 后对 4 取余数,根据序号获得下一位玩家,再将牌发给这位玩家。
发完牌后对玩家手中的牌进行排序。为方便排序,我们通过 int getV(char 花色, char 牌号) 获取牌的大小,将玩家手中的牌两两比较,按升序排序,最后按题目要求的格式进行输出。
程序源码
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include<stdio.h>
using namespace std;
char D[4] = { 'N','E','S','W' }; //当前玩家
char S[30], W[30], N[30], E[30]; //
int n, a, b;
char o, p, q;
int getType(char t) { //返回发牌员的序号
if (t == 'N')return 0;
else if (t == 'E')return 1;
else if (t == 'S')return 2;
else if (t == 'W')return 3;
}
int getV(char p, char t) { //返回牌的大小
int q = -1, w = -1; //花色序号*20 + 牌序号
if (t == '2') q = 1;
else if (t == '3') q = 2;
else if (t == '4') q = 3;
else if (t == '5') q = 4;
else if (t == '6') q = 5;
else if (t == '7') q = 6;
else if (t == '8') q = 7;
else if (t == '9') q = 8;
else if (t == 'T') q = 9;
else if (t == 'J') q = 10;
else if (t == 'Q') q = 11;
else if (t == 'K') q = 12;
else if (t == 'A') q = 13;
if (p == 'C') p = 1;
else if (p == 'D') p = 2;
else if (p == 'S') p = 3;
else if (p == 'H') p = 4;
return p * 20 + q;
}
int main()
{
while (1) {
cin >> o; // o->发牌员
if (o == '#') break; //结束
n = (getType(o) + 1) % 4; //指向下一位玩家
int aa = 0, bb = 0, cc = 0, dd = 0;
char I[200] = { 0 };
scanf("%s", &I[0], 53); //从输入读取牌面
scanf("%s", &I[52], 53); //第二行输入
for (int i = 0; i < 104; i += 2) { //模拟发牌步骤
if (n == 0) {
N[aa++] = I[i];
N[aa++] = I[i + 1];
}
else if (n == 1) {
E[bb++] = I[i];
E[bb++] = I[i + 1];
}
else if (n == 2) {
S[cc++] = I[i];
S[cc++] = I[i + 1];
}
else if (n == 3) {
W[dd++] = I[i];
W[dd++] = I[i + 1];
}
n = (n + 1) % 4; //下一位
}
//接下来对每一位玩家的牌进行排序
int Vi = 0, Vj = 0;
for (int i = 0; i < 13; i++) { //对N玩家的牌排序
for (int j = i; j < 13; j++) {
Vi = getV(N[2 * i], N[2 * i + 1]); //获取牌的大小
Vj = getV(N[2 * j], N[2 * j + 1]);
if (Vj < Vi) {
char t1, t2;
t1 = N[2 * j]; t2 = N[2 * j + 1];
N[2 * j] = N[2 * i];
N[2 * j + 1] = N[2 * i + 1];
N[2 * i] = t1;
N[2 * i + 1] = t2;
}
}
}
for (int i = 0; i < 13; i++) { //对S玩家的牌排序
for (int j = i; j < 13; j++) {
Vi = getV(S[2 * i], S[2 * i + 1]);
Vj = getV(S[2 * j], S[2 * j + 1]);
if (Vj < Vi) {
char t1, t2;
t1 = S[2 * j]; t2 = S[2 * j + 1];
S[2 * j] = S[2 * i];
S[2 * j + 1] = S[2 * i + 1];
S[2 * i] = t1;
S[2 * i + 1] = t2;
}
}
}
for (int i = 0; i < 13; i++) { //对W玩家的牌排序
for (int j = i; j < 13; j++) {
Vi = getV(W[2 * i], W[2 * i + 1]);
Vj = getV(W[2 * j], W[2 * j + 1]);
if (Vj < Vi) {
char t1, t2;
t1 = W[2 * j]; t2 = W[2 * j + 1];
W[2 * j] = W[2 * i];
W[2 * j + 1] = W[2 * i + 1];
W[2 * i] = t1;
W[2 * i + 1] = t2;
}
}
}
for (int i = 0; i < 13; i++) { //对E玩家的牌排序
for (int j = i; j < 13; j++) {
Vi = getV(E[2 * i], E[2 * i + 1]);
Vj = getV(E[2 * j], E[2 * j + 1]);
if (Vj < Vi) {
char t1, t2;
t1 = E[2 * j]; t2 = E[2 * j + 1];
E[2 * j] = E[2 * i];
E[2 * j + 1] = E[2 * i + 1];
E[2 * i] = t1;
E[2 * i + 1] = t2;
}
}
}
//接下来按题目要求进行输出
cout << "South player:\n+---+---+---+---+---+---+---+---+---+---+---+---+---+\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", S[2 * i + 1], S[2 * i + 1]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("| %c ", S[2 * i]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", S[2 * i + 1], S[2 * i + 1]);
}
cout << "|\n";
cout << "+---+---+---+---+---+---+---+---+---+---+---+---+---+\n";
cout << "West player:\n+---+---+---+---+---+---+---+---+---+---+---+---+---+\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", W[2 * i + 1], W[2 * i + 1]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("| %c ", W[2 * i]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", W[2 * i + 1], W[2 * i + 1]);
}
cout << "|\n";
cout << "+---+---+---+---+---+---+---+---+---+---+---+---+---+\n";
cout << "North player:\n+---+---+---+---+---+---+---+---+---+---+---+---+---+\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", N[2 * i + 1], N[2 * i + 1]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("| %c ", N[2 * i]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", N[2 * i + 1], N[2 * i + 1]);
}
cout << "|\n";
cout << "+---+---+---+---+---+---+---+---+---+---+---+---+---+\n";
cout << "East player:\n+---+---+---+---+---+---+---+---+---+---+---+---+---+\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", E[2 * i + 1], E[2 * i + 1]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("| %c ", E[2 * i]);
}
cout << "|\n";
for (int i = 0; i < 13; i++) {
printf("|%c %c", E[2 * i + 1], E[2 * i + 1]);
}
cout << "|\n";
cout << "+---+---+---+---+---+---+---+---+---+---+---+---+---+\n\n";
}
return 0;
}
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|
+---+---+---+---+---+---+---+---+---+---+---+---+---+