B1018. 锤子剪刀布

#include <bits/stdc++.h>
int change(char c){
    if(c == ‘B‘){
        return 0;
    }
    if(c == ‘C‘){
        return 1;
    }
    if(c == ‘J‘){
        return 2;
    }
}
char unchange(int n){
    if(n == 0){
        return ‘B‘;
    }
    if(n == 1){
        return ‘C‘;
    }
    if(n == 2){
        return ‘J‘;
    }
}
int main(int argc, char *argv[]) {
    int n;     
    scanf("%d", &n);// 记录行数
    int times_A[3] = {0, 0, 0}, times_B[3] = {0, 0, 0}; // 记录甲乙胜平负次数 
    char c1, c2;
    int k1, k2;
    int count1[3] = {0, 0, 0}, count2[3] = {0, 0, 0};// 记录甲、乙获胜次数 
    int max1, max2, index1, index2;// 记录最大值和最大值对应的数组下标
    for(int i = 0; i < n; i++){
        getchar();
        scanf("%c %c", &c1, &c2);
        // 将手势转为数字 
        k1 = change(c1);
        k2 = change(c2);
        // 甲赢 
        if((k1 + 1)%3 == k2){
            times_A[0]++;
            times_B[2]++;
            count1[k1]++;
        // 平手 
        }else if(k1 == k2){
            times_A[1]++;
            times_B[1]++;
        // 乙赢 
        }else if((k2 + 1)%3 == k1){
            times_A[2]++;
            times_B[0]++;
            count2[k2]++;
        }
    }         
    printf("%d %d %d\n", times_A[0], times_A[1], times_A[2]);    
    printf("%d %d %d\n", times_B[0], times_B[1], times_B[2]);
    max1 = count1[0];
    max2 = count2[0];
    index1 = 0;
    index2 = 0;
    for(int i = 1;i < 3; i++){
        if(max1 < count1[i]){
            max1 = count1[i];
            index1 = i;
        }
        if(max2 < count2[i]){
            max2 = count2[i];
            index2 = i;
        }
    }
    printf("%c %c", unchange(index1), unchange(index2));
    return 0;    
}