ZOJ Problem Set - 1057||Undercut

Undercut

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

Undercut is a card game where two players each have five cards numbered one through five. At each round, each player selects a card, then simultaneously reveals it. If the cards are of equal value, there is no score. Otherwise, there are two cases: the two cards are exactly one point apart (this is called an undercut), or the cards are more than one point apart. In the latter case, the person revealing the larger of the cards gets the number of points on the larger card. In the case of an undercut the player with the lower card gets the sum of the two cards. The exception to this is when the cards are 1 and 2, in which case the player with the lower card gets 6 points (instead of only 3 points). After each round, the cards are returned to the hands and they play another round.

For example, if there are 5 rounds and player A plays (in this order) 5, 3, 1, 3, 5 and player B plays 3, 3, 3, 3, 4, then the scoring for each round would be: A gets 5 points, no points, B gets 3 points, no points, B gets 9 points. The totals would be A: 5, B: 12.

In this problem you will be given card plays for both players and must determine the final scores.
 

Input

There will be multiple input instances. Each instance will be one game. The first line of input for a game will be an integer n <= 20. (A value of n = 0 terminates input.) The next two lines will each contain n integers between 1 and 5 inclusive indicating the cards played on each of n rounds. The first line are player A's card plays and the second line are player B's card plays.
 

Output

Each input instance should generate one line of output of the form:

A has a points. B has b points.

where the value of a and b are for you to determine. A blank line should separate output lines.
 

Sample Input

5
5 3 1 3 5
3 3 3 3 4
4
2 3 1 1
1 5 5 5
0
 

Sample Output

A has 5 points. B has 12 points.

A has 0 points. B has 21 points

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int A=0,B=0;

void MyScanf(int c[],int n){
    for(int i=0;i<n;i++){
        cin>>c[i];
    }
}

void MyCalculate(int a,int b){
    if(a>b){
        int temp = a-b;
        if(temp==1){
            if(a==2&&b==1){
                B+=6;
            }
            else
                B+=a+b;
            }
        else
            A+=a;
        }
    if(a<b){
        int temp = b-a;
        if(temp==1){
            if(a==1&&b==2){
                A+=6;
            }
            else
                A+=a+b;
            }
        else
            B+=b;
        }
}

int main(){
    int T;
    int flage=0;
    while(scanf("%d",&T)&&T!=0){

        A=B=0;
        int a[20],b[20];
        MyScanf(a,T);
        MyScanf(b,T);
        for(int i=0;i<T;i++){
            MyCalculate(a[i],b[i]);
        }
        if(flage)
            cout<<endl;
        cout<<"A has "<<A<<" points. B has "<<B<<" points."<<endl;
        flage=1;
    }
    return 0;
}