undercut.txt

The Drunk Jailer acm zju pku 上的题目

#include <stdio.h>

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

        return 0;
}