技術標籤：Codeup新家

注意：
甲乙石頭剪刀布的順序
順序不對就是43分

#include<cstdio>
char compareSize(int *a);
int main(){
	int N = 0;
	//x為甲 
	char x, y;
	//甲的勝負局數 
	int win = 0;
	int lose = 0;
	//a0布 a1錘子 a2剪刀 
	int a[3] = {0};
	//甲輸的局勢表同上 
	//b0剪刀 b1布 b2錘子 
	//b0布 b1錘子 b2剪刀 
	int b[3] = {0};
	int i = 0;
	scanf("%d", &N);
	getchar
 
();
	for(i = 0; i < N; i++){
		scanf("%c %c", &x, &y);
		if(x == 'J'){
			if(y == 'B'){
				win++;
				a[2]++;
			}
			if(y == 'C'){
				lose++;
				b[1]++;
			}
			
		}
		
		if(x == 'C'){
			if(y == 'J'){
				win++;
				a[1]++;
			}
			if(y == 'B'){
				lose++;
				b[0]++;
			}
			
		}
 

		
		if(x == 'B'){
			if(y == 'C'){
				win++;
				a[0]++;
			}
			if(y == 'J'){
				lose++;
				b[2]++;
			}
			
		}
		getchar();
		
	}
	
	printf("%d %d %d\n", win, (N-win-lose), lose);
	printf("%d %d %d\n", lose, (N-win-lose), win);
	char j, Y;
	j = compareSize(a);
	Y = compareSize
 
(b);	
	printf("%c %c\n", j, Y);
	return 0;
}
char compareSize(int *a){
	int i = 0;
	int pos = 0;
	int max = a[0];
	for(i = 0; i < 3; i++){
		if(max < a[i]){
			max = a[i];
			pos = i;
		}
	}
	if(pos == 0){
		return 'B';
	}else if(pos == 1){
		return 'C';
	}else if(pos == 2){
		return 'J';
	}
}