Repository navigation
Expand file tree
/
Copy pathpuke.c
More file actions
220 lines (213 loc) · 6.74 KB
/
Copy pathpuke.c
File metadata and controls
220 lines (213 loc) · 6.74 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
#include <stdio.h>
int judge_same_point(float point1, float point2, float point3) {
/*该函数用于判断点数相同的个数*/
float average;
average = (point1 + point2 + point3) / 3; // 3个点数的平均数
if (point1 == point2 && point2 == point3) {
return 1; // 3个点数相同
}
else if (point1 == point2 && point2 != point3 || point1 == point3 && point2 != point3 || point2 == point3 && point3 != point1) {
return 2; // 2个点数相同
}
else if (average == point1 || average == point2 || average == point3) {
return 3; // 3个点数相邻
}
else {
return 4; // 3个点数不同
}
}
int calculate_sum_point(int point, char colour) {
/*该函数用于计算总点数*/
int sum_point;
if (colour == 'S') {
sum_point = point + 4;
}
else if (colour == 'H') {
sum_point = point + 3;
}
else if (colour == 'C') {
sum_point = point + 2;
}
else {
sum_point = point + 1;
}
return sum_point;
}
int max_point(int point1, int point2, int point3, char colour1, char colour2, char colour3) {
/*该函数用于判断最大点数对应的第n张牌 返回值的意义:1 2 3代表第几张牌,返回1就代表第一张牌的点数最大*/
int max, a, b, c, same_point;
same_point = judge_same_point(point1, point2, point3);
/*三张牌点数都相同的情况*/
if (same_point == 1) {
/*调用函数计算总点数*/
a = calculate_sum_point(point1, colour1);
b = calculate_sum_point(point2, colour2);
c = calculate_sum_point(point3, colour3);
if (a > b) {
if (a > c) {
return 1;
}
else {
return 3;
}
}
else {
if (b > c) {
return 2;
}
else {
return 3;
}
}
}
/*只有两张牌点数相同的情况*/
else if (same_point == 2) {
if (point1 == point2) {
a = calculate_sum_point(point1, colour1);
b = calculate_sum_point(point2, colour2);
if (a > b) {
return 1;
}
else {
return 2;
}
}
else if (point1 == point3) {
a = calculate_sum_point(point1, colour1);
c = calculate_sum_point(point3, colour3);
if (a > c) {
return 1;
}
else {
return 3;
}
}
else if (point2 == point3) {
b = calculate_sum_point(point2, colour2);
c = calculate_sum_point(point3, colour3);
if (b > c) {
return 2;
}
else {
return 3;
}
}
}
/*三张牌的点数都不相同的情况*/
else {
if (point1 > point2) {
if (point1 > point3) {
return 1;
}
else {
return 3;
}
}
else {
if (point2 > point3) {
return 2;
}
else {
return 3;
}
}
}
}
void output_type(int point1, int point2, int point3, char colour1, char colour2, char colour3) {
/*该函数用于输出牌型*/
int same_point_num = judge_same_point(point1, point2, point3); // 相同点数的个数;
if (same_point_num == 1) {
printf("Leopard"); // 豹子
}
else if (same_point_num == 2) {
printf("Pair"); // 对子
}
else if (same_point_num == 3) {
if (colour1 == colour2 && colour2 == colour3) {
printf("Flush straight"); // 同花顺
}
else {
printf("Straight"); // 顺子
}
}
else {
if (colour1 == colour2 && colour2 == colour3) {
printf("Same kind"); // 同花
}
else {
printf("General"); // 花牌
}
}
}
void output_colour(int point, char colour) {
char point_arr[] = "01234567890JQKA"; // 字符数组,以点数为下标索引字符串里的数据
/*该函数用于输出最大点数及其对应的花色*/
if (point == 10) {
if (colour == 'S') {
printf("(Spade 10)");
}
else if (colour == 'H') {
printf("(Heart 10)");
}
else if (colour == 'C') {
printf("(Club 10)");
}
else {
printf("(Diamond 10)");
}
}
else {
if (colour == 'S') {
printf("(Spade %c)", point_arr[point]);
}
else if (colour == 'H') {
printf("(Heart %c)", point_arr[point]);
}
else if (colour == 'C') {
printf("(Club %c)", point_arr[point]);
}
else {
printf("(Diamond %c)", point_arr[point]);
}
}
}
void output_max_colour(int point1, int point2, int point3, char colour1, char colour2, char colour3) {
/*该函数用于判断最大点数对应的第n张牌并调用output_colour函数*/
int MaxPoint = max_point(point1, point2, point3, colour1, colour2, colour3); // 最大点数对应的第n张牌
switch(MaxPoint) {
case 1: output_colour(point1, colour1); break;
case 2: output_colour(point2, colour2); break;
default: output_colour(point3, colour3); break;
}
}
int main () {
/*主函数,调用各个子函数*/
int w_point_1, w_point_2, w_point_3, z_point_1, z_point_2, z_point_3, l_point_1, l_point_2, l_point_3;
char w_colour_1, w_colour_2, w_colour_3, z_colour_1, z_colour_2, z_colour_3, l_colour_1, l_colour_2, l_colour_3;
int conut, flag;
flag = 1;
scanf("%d", &conut);
while (conut > 0) {
scanf("%d %c %d %c %d %c %d %c %d %c %d %c %d %c %d %c %d %c",
&w_point_1,&w_colour_1,&w_point_2,&w_colour_2,&w_point_3,&w_colour_3,
&z_point_1,&z_colour_1,&z_point_2,&z_colour_2,&z_point_3,&z_colour_3,
&l_point_1,&l_colour_1,&l_point_2,&l_colour_2,&l_point_3,&l_colour_3
);
printf("%d:\n",flag); // 输出第n组数据
printf("Wangwu:");
output_type(w_point_1, w_point_2, w_point_3, w_colour_1, w_colour_2, w_colour_3);
output_max_colour(w_point_1, w_point_2, w_point_3, w_colour_1, w_colour_2, w_colour_3);
printf("\n");
printf("Zhangsan:");
output_type(z_point_1, z_point_2, z_point_3, z_colour_1, z_colour_2, z_colour_3);
output_max_colour(z_point_1, z_point_2, z_point_3, z_colour_1, z_colour_2, z_colour_3);
printf("\n");
printf("Lisi:");
output_type(l_point_1, l_point_2, l_point_3, l_colour_1, l_colour_2, l_colour_3);
output_max_colour(l_point_1, l_point_2, l_point_3, l_colour_1, l_colour_2, l_colour_3);
printf("\n");
conut--;
flag++;
}
return 0;
}