zoj-1057
来源:互联网 发布:哈里路亚淘宝 编辑:程序博客网 时间:2024/06/05 00:09
#include<stdio.h>#define maxn 20int main(){ //freopen("d:\\test.txt","r",stdin); int flag=0,n,a[maxn],b[maxn]; while(scanf("%d",&n) && n) { int i; for(i=0;i<n;++i) scanf("%d",&a[i]); for(i=0;i<n;++i) scanf("%d",&b[i]); int sa=0; int sb=0; for(i=0;i<n;++i) { if(a[i]<b[i]) { if(a[i]==1 && b[i]==2) sa+=6; else if(b[i]-a[i]==1) sa+=a[i]+b[i]; else sb+=b[i]; } else if(a[i]>b[i]) { if(a[i]==2 && b[i]==1) sb+=6; else if(a[i]-b[i]==1) sb+=a[i]+b[i]; else sa+=a[i]; } } if(flag) printf("\n"); flag=1; printf("A has %d points. B has %d points.\n",sa,sb); } return 0;}