undercut1.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){c=0;d=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-1;i++){
                    if (a[i]==1&&b[i]==2)
                        c+=6;
                    else{
                        if (b[i]==1&&a[i]==2)
                            d+=6;
                        else{
							switch(a[i]-b[i]) {
						        case -4:d+=b[i];
                                        break;
                                case -3:d+=b[i];
                                        break;
                                case -2:d+=b[i];
                                        break;
                                case -1:c+=b[i]+a[i];
                                        break;
                                case 0:
                                        break;
                                case 1:d+=b[i]+a[i];
                                        break;
                                case 2:c+=a[i];
                                        break;
                                case 3:c+=a[i];
                                        break;
                                case 4:c+=a[i];
                                        break;
                        }
                   }
               }
            }
        printf("A has %d points. B has %d points.\n",c,d);
        scanf ("%d",&n);
		if (n!=0)
			printf("\n");
	}
	return 0;
}