ZOJ-1057 这题看的会哭出来<坑!>

来源:互联网 发布:超星尔雅网络通识课 编辑:程序博客网 时间:2024/05/02 00:55
#include<stdio.h>#include<math.h>int popk[2][20];int main(){int n,i,A,B;int falg=0;while(scanf("%d",&n)!=EOF&&n!=0){A=B=0;if(falg)printf("\n");for(i=0;i<n;i++)scanf("%d",&popk[0][i]);for(i=0;i<n;i++)scanf("%d",&popk[1][i]);for(i=0;i<n;i++){if(popk[0][i]==popk[1][i])continue;else if(popk[0][i]>popk[1][i]){if(popk[0][i]==2&&popk[1][i]==1){B+=6;}else if(popk[0][i]-popk[1][i]>1){A+=popk[0][i];}elseB+=popk[0][i]+popk[1][i];}else if(popk[0][i]<popk[1][i]){if(popk[0][i]==1&&popk[1][i]==2){A+=6;}else if(popk[1][i]-popk[0][i]>1){B+=popk[1][i];}elseA+=popk[0][i]+popk[1][i];}}printf("A has %d points. B has %d points.\n",A,B);falg=1;}return 0;}

0 0
原创粉丝点击