PersonalCorpus 版 (精华区)

寄信人: ooze (烂泥~苦读武侠中)
标  题: 1057
发信站: 哈工大紫丁香 (2002年05月12日15:13:55 星期天)
来  源: 202.118.239.224 

16024
2002-05-12 15:16:20
Accepted
1057
C++
00:00.00
384K
Big Guava


#include"stdio.h"

int main()
{
//  freopen("input1057.txt","r",stdin); 
//  freopen("output1057.txt","w",stdout);

    int a[20],b[20];
    int i,j,k,ra,rb,n;

    scanf("%d\n",&n);
    while (n) {
        for (i=0;i<n-1;i++) scanf("%d",a+i);
        scanf("%d\n",a+n-1);
        for (i=0;i<n-1;i++) scanf("%d",b+i);
        scanf("%d\n",b+n-1);
        ra=0; rb=0;
        for (i=0;i<n;i++) {
            if (a[i]==b[i]) continue;
            if (a[i]>b[i]+1) {
                ra+=a[i];
                continue;
            }
            if (b[i]>a[i]+1) {
                rb+=b[i];
                continue;
            }
            
            if (a[i]==b[i]+1) 
                if (b[i]==1) rb+=6; else rb+=a[i]+b[i]; 
            else if (a[i]==1) ra+=6; else ra+=a[i]+b[i];
        }
        printf("A has %d points. B has %d points.\n",ra,rb);
        scanf("%d\n",&n); if (n!=0) printf("\n");
    }
}

--
※ 来源:·哈工大紫丁香 bbs.hit.edu.cn·[FROM: 202.118.239.224]
--
※ 转寄:.哈工大紫丁香 bbs.hit.edu.cn.[FROM: 202.118.239.224]
[百宝箱] [返回首页] [上级目录] [根目录] [返回顶部] [刷新] [返回]
Powered by KBS BBS 2.0 (http://dev.kcn.cn)
页面执行时间:3.430毫秒