1018. 锤子剪刀布 (20)

题目：http://www.patest.cn/contests/pat-b-practise/1018

代码：

#include<stdio.h>

int main()
{
    int n,i;
    int j_win=0,y_win=0,equ=0;
    int a[3],b[3];  //a代表甲，a[0]为甲胜利时B的个数，a[1]为C的个数，a[2]为J的个数。b同
    char x,y,z;
    void more(int c[]);

    for (i=0;i<3;i++)
    {
        a[i] = 0;
        b[i] = 0;
    }

    scanf("%d",&n);
    for (i=0;i<n;i++)
    {
        scanf("%c %c %c",&z,&x,&y);
        if (x=='C')
        {
            if (y=='C')
                equ++;
            else if(y=='J')
            {
                j_win++;
                a[1]++;
            }
            else
            {
                y_win++;
                b[0]++;
            }
        }
        else if (x=='J')
        {
            if (y=='J')
                equ++;
            else if(y=='B')
            {
                j_win++;
                a[2]++;
            }
            else
            {
                y_win++;
                b[1]++;
            }
        }
        else
        {
            if (y=='B')
                equ++;
            else if(y=='J')
            {
                y_win++;
                b[2]++;
            }
            else
            {
                j_win++;
                a[0]++;
            }
        }
    }

    printf("%d %d %d\n",j_win,equ,n-j_win-equ);
    printf("%d %d %d\n",y_win,equ,n-y_win-equ);

    more(a);
    printf(" ");
    more(b);

    return 0;
}

void more(int c[])
{
    int flag,i,max;
    max = c[0];
    flag = 0;
    for (i=1;i<3;i++)
    {
        if (c[i]>max)
        {
            max = c[i];
            flag = i;
        }
    }
    if (flag == 0)
        printf("B");
    else if(flag==1)
        printf("C");
    else
        printf("J");
}