ZOJ-1057

来源:互联网 发布:移动网络玩传奇霸业 编辑:程序博客网 时间:2024/06/05 11:07

做几道水题调整调整下,这题就不多说了

#include<stdio.h>#include<stdlib.h>int main(){    int n, a[20], b[20], count = 0;    while (scanf("%d", &n), n)    {        if (count)            putchar('\n');        count++;        int i;        for (i = 0; i < n; i++)            scanf("%d", &a[i]);        for (i = 0; i < n; i++)            scanf("%d", &b[i]);        int pa = 0, pb = 0;        for (i = 0; i < n; i++)        {            if (a[i] == b[i])                continue;            else if (abs(a[i] - b[i]) == 1)            {                int p = a[i] + b[i] == 3 ? 6 : a[i] + b[i];                if (a[i] > b[i])                    pb += p;                else                    pa += p;            }            else            {                if (a[i] > b[i])                    pa += a[i];                else                    pb += b[i];            }        }        printf("A has %d points. B has %d points.\n", pa, pb);    }    return 0;}


0 0
原创粉丝点击