PAT Basic 1018. 锤子剪刀布 (20) (C语言实现) | PAT Solution in C

[xlucn]

https://oliverlew.github.io/PAT/Basic/1018.html

题目

[ShaobinChen-AH]

答案错误了，找不到原因？求指点，代码如下:

#include<stdio.h>
int pk(char hand1,char hand2){
    if(hand1=='C'&&hand2=='J') return 1;
    if(hand1=='C'&&hand2=='B') return 0;
    if(hand1=='J'&&hand2=='C') return 0;
    if(hand1=='J'&&hand2=='B') return 1;
    if(hand1=='B'&&hand2=='C') return 1;
    if(hand1=='B'&&hand2=='J') return 0;
}
int main()
{
    int N,handle1[3]={0},handle2[3]={0},ascii1[128]={0},ascii2[128]={0};
    char hand1,hand2;
    scanf("%d\n",&N);
    for(int i=0;i<N;i++)
    {
        scanf("%c %c\n",&hand1,&hand2);
        if((hand1==hand2)&&((hand1=='C')||(hand1=='J')||(hand1=='B'))){
        handle1[1]++; 
         handle2[1]++;
        }
        else{
            int result=pk(hand1,hand2);
            if(result==1){
               handle1[0]++;
               handle2[2]++;
               ascii1[(int)hand1]++;
            }
            else{
                handle1[2]++;
                handle2[0]++;
                ascii2[(int)hand2]++;
            }
        } 
    }
    printf("%d %d %d\n",handle1[0],handle1[1],handle1[2]);
    printf("%d %d %d\n",handle2[0],handle2[1],handle2[2]);
    int max1=0,max2=0;
    for(int i=1;i<128;i++)
    {
       if(ascii1[i]>ascii1[max1]) max1=i;
    }
    for(int i=1;i<128;i++)
    {
       if(ascii2[i]>ascii2[max2]) max2=i;
    }
    printf("%c %c",max1,max2);
    return 0;
}