ZOJ--1057：Undercut

比较简单 直接上代码

import java.util.Scanner;

public class ZOJ_1057 {
	static int n,a,b,flag=0;
	static int arr[]=new int[20],brr[]=new int[20];
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		while((n=s.nextInt())!=0){
			if(flag!=0)
				System.out.println();
			flag=1;
			for(int i=0;i<n;i++)
				arr[i]=s.nextInt();
			for(int i=0;i<n;i++)
				brr[i]=s.nextInt();
			a=0;b=0;
			for(int i=0;i<n;i++){
				if(arr[i]>brr[i]){
					if(arr[i]-brr[i]==1){
						if(brr[i]==1)
							b+=6;
						else
							b+=arr[i]+brr[i];
					}else
						a+=arr[i];
				}
				else if(arr[i]<brr[i]){
					if(brr[i]-arr[i]==1){
						if(arr[i]==1)
							a+=6;
						else
							a+=arr[i]+brr[i];
					}else
						b+=brr[i];
				}
			}
			System.out.println("A has "+a+" points. B has "+b+" points.");
		}
	}
}