#include <stdio.h>
#include <string.h>
int main()
{
while (1)
{
char a[100][5], b[100][5], c[100][5], d[100][5];
int na[100], nb[100], nc[100], nd[100]; //0 是牌数
int h[15] = {-50, -2,-3,-4,-5,-6,-7,-8,-9,-10,-20,-30,-40};
int ra = 0, rb = 0, rc = 0, rd = 0;
scanf ("%d", &na[0]);
for (int i = 1; i <= na[0]; i++) //从1开始的！！
scanf (" %s", a[i]);
scanf ("%d", &nb[0]);
for (int i = 1; i <= nb[0]; i++) //从1开始的！！
scanf (" %s", b[i]);
scanf ("%d", &nc[0]);
for (int i = 1; i <= nc[0]; i++) //从1开始的！！
scanf (" %s", c[i]);
scanf ("%d", &nd[0]);
for (int i = 1; i <= nd[0]; i++) //从1开始的！！
scanf (" %s", d[i]);
if (na[0] == 0 && nb[0] == 0 && nc[0] == 0 && nd[0] == 0)
break;
else
{
for (int i = 1; i <= na[0]; i++)
{
if (a[i][0] == 'C')
na[i] = 0;
else if (a[i][0] == 'D')
na[i] = 1;
else if (a[i][0] == 'S')
na[i] = 2;
else if (a[i][0] == 'H')
na[i] = 3;
if (a[i][1] == '1' && a[i][2] == '0')
na[i] = na[i] + 36;
else if (a[i][1] == '1' && a[i][2] == '1')
na[i] = na[i] + 40;
else if (a[i][1] == '1' && a[i][2] == '2')
na[i] = na[i] + 44;
else if (a[i][1] == '1' && a[i][2] == '3')
na[i] = na[i] + 48;
else if (a[i][1] >= '1' && a[i][1] <= '9')
na[i] = na[i] + (a[i][1] - '0' - 1) * 4;
}
for (int i = 1; i <= nb[0]; i++)
{
if (b[i][0] == 'C')
nb[i] = 0;
else if (b[i][0] == 'D')
nb[i] = 1;
else if (b[i][0] == 'S')
nb[i] = 2;
else if (b[i][0] == 'H')
nb[i] = 3;
if (b[i][1] == '1' && b[i][2] == '0')
nb[i] = nb[i] + 36;
else if (b[i][1] == '1' && b[i][2] == '1')
nb[i] = nb[i] + 40;
else if (b[i][1] == '1' && b[i][2] == '2')
nb[i] = nb[i] + 44;
else if (b[i][1] == '1' && b[i][2] == '3')
nb[i] = nb[i] + 48;
else if (b[i][1] >= '1' && b[i][1] <= '9')
nb[i] = nb[i] + (b[i][1] - '0' - 1) * 4;
}
for (int i = 1; i <= nc[0]; i++)
{
if (c[i][0] == 'C')
nc[i] = 0;
else if (c[i][0] == 'D')
nc[i] = 1;
else if (c[i][0] == 'S')
nc[i] = 2;
else if (c[i][0] == 'H')
nc[i] = 3;
if (c[i][1] == '1' && c[i][2] == '0')
nc[i] = nc[i] + 36;
else if (c[i][1] == '1' && c[i][2] == '1')
nc[i] = nc[i] + 40;
else if (c[i][1] == '1' && c[i][2] == '2')
nc[i] = nc[i] + 44;
else if (c[i][1] == '1' && c[i][2] == '3')
nc[i] = nc[i] + 48;
else if (c[i][1] >= '1' && c[i][1] <= '9')
nc[i] = nc[i] + (c[i][1] - '0' - 1) * 4;
}
for (int i = 1; i <= nd[0]; i++)
{
if (d[i][0] == 'C')
nd[i] = 0;
else if (d[i][0] == 'D')
nd[i] = 1;
else if (d[i][0] == 'S')
nd[i] = 2;
else if (d[i][0] == 'H')
nd[i] = 3;
if (d[i][1] == '1' && d[i][2] == '0')
nd[i] = nd[i] + 36;
else if (d[i][1] == '1' && d[i][2] == '1')
nd[i] = nd[i] + 40;
else if (d[i][1] == '1' && d[i][2] == '2')
nd[i] = nd[i] + 44;
else if (d[i][1] == '1' && d[i][2] == '3')
nd[i] = nd[i] + 48;
else if (d[i][1] >= '1' && d[i][1] <= '9')
nd[i] = nd[i] + (d[i][1] - '0' - 1) * 4;
}
int ns = 0, nnd = 0, nnc = 0, nf = 0, nh = 0;
for (int i = 1; i <= na[0]; i++)
{
if (na[i] % 4 == 3)
{
nh++;
nf++;
ra = ra + h[na[i] / 4];
}
if (na[i] == 46)
{
ra = ra - 100;
ns = 1;
nf++;
}
if (na[i] == 41)
{
ra = ra + 100;
nnd = 1;
nf++;
}
if (na[i] == 36)
{
nnc = 1;
nf++;
}
}
if (nh == 13 && nnd == 1 && ns == 1)
ra = 500;
if (nh == 13)
ra = ra + 194 + 200;
if (nnc == 1 && na[0] == 1)
ra = 50;
else if (nnc == 1)
ra = ra * 2;
if (nf == 16)
ra = 1000;
ns = 0, nnd = 0, nnc = 0, nf = 0, nh = 0;
for (int i = 1; i <= nb[0]; i++)
{
if (nb[i] % 4 == 3)
{
nh++;
nf++;
rb = rb + h[nb[i] / 4];
}
if (nb[i] == 46)
{
rb = rb - 100;
ns = 1;
nf++;
}
if (nb[i] == 41)
{
rb = rb + 100;
nnd = 1;
nf++;
}
if (nb[i] == 36)
{
nnc = 1;
nf++;
}
}
if (nh == 13 && nnd == 1 && ns == 1)
rb = 500;
if (nh == 13)
rb = rb + 194 + 200;
if (nnc == 1 && nb[0] == 1)
rb = 50;
else if (nnc == 1)
rb = rb * 2;
if (nf == 16)
rb = 1000;
ns = 0, nnd = 0, nnc = 0, nf = 0, nh = 0;
for (int i = 1; i <= nc[0]; i++)
{
if (nc[i] % 4 == 3)
{
nh++;
nf++;
rc = rc + h[nc[i] / 4];
}
if (nc[i] == 46)
{
rc = rc - 100;
ns = 1;
nf++;
}
if (nc[i] == 41)
{
rc = rc + 100;
nnd = 1;
nf++;
}
if (nc[i] == 36)
{
nnc = 1;
nf++;
}
}
if (nh == 13 && nnd == 1 && ns == 1)
rc = 500;
if (nh == 13)
rc = rc + 194 + 200;
if (nnc == 1 && nc[0] == 1)
rc = 50;
else if (nnc == 1)
rc = rc * 2;
if (nf == 16)
rc = 1000;
ns = 0, nnd = 0, nnc = 0, nf = 0, nh = 0;
for (int i = 1; i <= nd[0]; i++)
{
if (nd[i] % 4 == 3)
{
nh++;
nf++;
rd = rd + h[nd[i] / 4];
}
if (nd[i] == 46)
{
rd = rd - 100;
ns = 1;
nf++;
}
if (nd[i] == 41)
{
rd = rd + 100;
nnd = 1;
nf++;
}
if (nd[i] == 36)
{
nnc = 1;
nf++;
}
}
if (nh == 13 && nnd == 1 && ns == 1)
rd = 500;
if (nh == 13)
rd = rd + 194 + 200;
if (nnc == 1 && nd[0] == 1)
rd = 50;
else if (nnc == 1)
rd = rd * 2;
if (nf == 16)
rd = 1000;
}
if (ra > 0) printf ("+%d ", ra);
else if (ra < 0) printf ("%d ", ra);
else if (ra == 0) printf ("0 ");
if (rb > 0) printf ("+%d ", rb);
else if (rb < 0) printf ("%d ", rb);
else if (rb == 0) printf ("0 ");
if (rc > 0) printf ("+%d ", rc);
else if (rc < 0) printf ("%d ", rc);
else if (rc == 0) printf ("0 ");
if (rd > 0) printf ("+%d\n", rd);
else if (rd < 0) printf ("%d\n", rd);
else if (rd == 0) printf ("0\n");
}
}
2017-程序设计基础（c语言）.zip （117个子文件） 
H16：拱猪计分（选作）.cpp 6KB Poker time 2 enhanced version，选做.cpp 4KB （BOSS）Poker time! （使用结构）.cpp 3KB （BOSS）Poker time! （20 xp）.cpp 3KB H11：高精度加减法（选作）.cpp 2KB H21. 求循环节（选作）.cpp 2KB H24. 爱刷题的PQ大神（选作）.cpp 1KB H7：猜数字（选作）.cpp 1KB H24. 【中学】科学记数法（选做）.cpp 1KB H9：五年级小学生的题目（选做）.cpp 1KB 60. 链表排序.cpp 1KB H22：扫雷.cpp 1KB H1. 铺地板（选作）.cpp 1KB H6：扫雷（选做）.cpp 1KB H24：水王争霸.cpp 1KB H20：水王争霸（选作）.cpp 1KB 37. 【日期】黑色星期五.cpp 1KB H25：编码（选作）.cpp 1KB H7：数制转换（选作）.cpp 1023B H10：【日期】身份证的奥秘（选做）.cpp 1002B 52. 输出图形.cpp 988B H8：小蜜蜂（选作）.cpp 961B 42.【图形】字母X .cpp 960B 为整数编号.cpp 952B 19.【日期】再算星期（选做）.cpp 939B 54. 【大学】恭喜发财 利是窦来.cpp 920B 13.【中学】求解一元二次方程.cpp 866B H15：合并果子（选作）.cpp 866B 53.【日期】车辆限行.cpp 840B 46. 三角形是一个永不过时的话题.cpp 828B 【日期】计算天数+.cpp 817B H23. 渣渣的程序（选作）.cpp 792B H23：逆波兰算术表达式.cpp 780B 28.【图形】空心字符菱形.cpp 779B 赵三元老师小组-画一个字母组成的菱形.cpp 768B 50. 【字符】压缩文本文件.cpp 763B H17：逆波兰算术表达式（选作）.cpp 747B H13：编码问题（选作）.cpp 729B 字母梯形.cpp 726B Fishing or basking It's a choice..cpp 710B H22. 猜数字看人品（选作）.cpp 696B 27.【日期】计算后续日期.cpp 688B 48. 【中学】求特定三位数.cpp 676B 14.【日期】根据日期求星期.cpp 671B 26.【图形】数字菱形.cpp 666B 21.【日期】确定母亲节.cpp 653B 36. 【大学】北理工的恶龙.cpp 644B 40. 子串反向——递归.cpp 627B 58. 学生成绩排序.cpp 620B 47. 【大学】寻找矩阵的鞍点.cpp 608B 23.【小学】三做一年级算术题.cpp 597B H14：安全的密码（选做）.cpp 591B H18：数码管（选作）.cpp 589B 买东西.cpp 578B H14：洗牌（选作）.cpp 571B 49.【字符】计算子字符串个数.cpp 551B 29.【中学】求最后3位数值.cpp 546B 25.【图形】空心的倒三角型.cpp 539B H5：计算通用产品代码UPC的校验位（选作）.cpp 523B 51.【数列】等值数列段.cpp 514B Wanna be a star.cpp 509B 22.【中学】寻找特殊偶数.cpp 507B H5. 晕（选作）.cpp 505B H6：邮票组合（选作）.cpp 490B 赵三元老师小组-数字金字塔.cpp 484B 11. 【中学】计算时钟的夹角.cpp 464B H25. 机智的大师（选作）.cpp 461B 链表移动.cpp 439B 52. 猜猜我是谁.cpp 439B Fahrenheit-Celsius Conversion.cpp 431B 18.【中学】寻找阿姆斯特朗数.cpp 422B H12：子数整除（选作）.cpp 412B 30. 【字符】合并字符串.cpp 409B 41. 【日期】再算天数.cpp 409B 46. 【字符】自编车号.cpp 405B 34. 【字符】单词排序.cpp 405B 31. 【字符】组成最大数.cpp 403B 赵三元老师小组-零钱换整钱.cpp 395B 10. 【中学】判断三角形的形状.cpp 377B 【中学】哥俩好.cpp 369B H20：特别不高兴的女朋友（选作）.cpp 364B 链表处理.cpp 353B H21：大数分解（选作）.cpp 351B 55. 回文字符串——递归.cpp 349B 32.【中学】贪吃的猴子.cpp 330B 24.【中学】找出最大素数.cpp 320B 56. 【大学】求表示方法.cpp 307B 20.【小学】再做一年级算术题.cpp 307B 33. 【字符】串的减法.cpp 295B 整数分解 .cpp 291B 43. 【数列递归】求序列之和——递归.cpp 282B 【中学】谁能出线.cpp 277B 35. 【字符】删除重复字符.cpp 271B 赵三元老师小组-拆分整数 .cpp 228B 59. 建立正序链表.cpp 227B 44. 【中学】求最大公约数——递归.cpp 226B 16.【图形】数字正方型.cpp 224B 57. 安排比赛.cpp 220B 38. 【小学递归】杀鸡用牛刀——要用递归啊！.cpp 215B 8. 【中学】计算圆柱的侧面积及体积.cpp 214B共 117 条
- 1
- 2
资源评论
