ZOJ 1057 Undercut
2010-08-06 16:36
120 查看
//ZOJ 1057 Undercut 2010.08.06 #include <stdio.h> int main() { int n = 0; int cardA[20] = {0}; int cardB[20] = {0}; int scoreA = 0; int scoreB = 0; int i = 0; while(scanf("%d",&n) && n != 0) { if(i != 0) { printf("/n"); } for(i = 0;i < n;i++) { scanf("%d",&cardA[i]); } for(i = 0;i < n;i++) { scanf("%d",&cardB[i]); } scoreA = 0; scoreB = 0; for(i = 0;i < n;i++) { if(cardA[i] == 1 && cardB[i] == 2) { scoreA += 6; } else if(cardA[i] == 2 && cardB[i] == 1) { scoreB += 6; } else if(cardA[i] - cardB[i] == -1) { scoreA += cardA[i] + cardB[i]; } else if(cardA[i] - cardB[i] == 1) { scoreB += cardA[i] + cardB[i]; } else if(cardA[i] - cardB[i] < -1) { scoreB +=cardB[i]; } else if(cardA[i] - cardB[i] > 1) { scoreA += cardA[i]; } } printf("A has %d points. B has %d points./n",scoreA,scoreB); } return 0; }
相关文章推荐
- ZOJ Problem Set - 1057||Undercut
- ZOJ--1057:Undercut
- ZOJ-1057-Undercut
- ZOJ 1057 Undercut(简单模拟)
- zoj 1057 Undercut 水题
- ZOJ1057 Undercut
- ZOJ1057 Undercut
- 1057 Undercut
- ZOJ-1057
- ZOJ-1057 这题看的会哭出来<坑!>
- zoj 1047
- ZOJ-2520
- 解题报告 之 ZOJ2332 Gems
- zoj 3962 Seven Segment Display(数位dp)
- ZOJ 3204 Connect them 字典序输出最短路
- ZOJ 3659 Conquera New Region(并查集:维护根节点信息)
- zoj 3878 Convert QWERTY to Dvorak
- ZOJ 3963 Heap Partition(贪心)
- ZOJ 1450 Minimal Circle 求最小覆盖圆
- zoj 1709 Oil Deposits