HDU 4461 The Power of Xiangqi

大水题，好欢乐，需要注意的就是字符的读入，不要出错。

#include<stdio.h>
#include<iostream>
using namespace std;

#include<math.h>
#include<algorithm>
#include<string>
#include<map>
#include<queue>
#define repA(p,q,i)  for(int (i)=(p); (i)!=(q); ++(i) )
#define repD(p,q,i)  for(int (i)=(p); (i)!=(q); --(i) )
#define repAE(p,q,i)  for(int (i)=(p); (i)<=(q); ++(i) )
#define repDE(p,q,i)  for(int (i)=(p); (i)>=(q); --(i) )
#define range 1010

int n,m;
int p,q;
int A[10];
int B[10];
int li[7]={16, 7, 8, 1, 1, 2, 3};

int Asolve();
int Bsolve();

int main()
{
    int test;  scanf("%d",&test);
    while(test--)
    {
        p = Asolve();
        q = Bsolve();
        if(p > q)  printf("red\n");
        else if(p == q)  printf("tie\n");
        else printf("black\n");
    }
}

int Asolve()
{
    scanf("%d",&n);
    repA(0,10,i)
      A[i]=0;
    int total=0;
    char c;
    while(n--)
    {
        while( (c=getchar() ) == ' ' ) ;
        total += li[c-'A'];
        ++A[c-'A'];
    }
    if( (A[1]==0 || A[2]==0)  &&  total > 1 )
      --total;
    return total;
}

int Bsolve()
{
    scanf("%d",&m);
    repA(0,10,i)
      B[i]=0;
    int total=0;
    char c;
    while(m--)
    {
        while( (c=getchar() ) == ' ' ) ;
        total += li[c-'A'];
        ++B[c-'A'];
    }
    if( (B[1]==0 || B[2]==0)  &&  total > 1 )
      --total;
    return total;
}