PAT_B_1018 锤子剪刀布

匿名 (未验证) 提交于 2019-12-02 23:52:01

 

// PAT_1018_锤子剪刀布  # include <stdio.h>  int win_lose(char A, char B) { 	// 平手  	if (A==B) 		return 0; 	// 甲胜出  	else if (A=='C'&&B=='J' || A=='J'&&B=='B' || A=='B'&&B=='C') 		return 1; 	// 乙胜出 	else if (A=='J'&&B=='C' || A=='B'&&B=='J' || A=='C'&&B=='B') 		return -1;  }  int main(void) { 	int N; // 记录游戏次数  	int flag; 	char ch1, ch2; 	int win=0, lose=0, draw=0; 	int A_C=0, A_J=0, A_B=0;  	int B_C=0, B_J=0, B_B=0;  	int Max_A=0,Max_B=0; 	 	scanf("%d",&N); 	getchar(); 	while(N--) 	{ 		scanf("%c",&ch1); 		getchar(); 		scanf("%c",&ch2); 		getchar(); 		 		// 记录胜负平次数  		flag = win_lose(ch1, ch2); 		 		if (flag == 0) 			draw++; 		// 甲胜出  		else if (flag == 1) 		{ 			win++; 			switch(ch1)  			{ 				case 'B':A_B++;break; 				case 'J':A_J++;break; 				case 'C':A_C++;break; 				default:break; 			} 		}  		else if (flag == -1) 		{ 			lose++; 			switch(ch2) 			{ 				case 'B':B_B++;break; 				case 'J':B_J++;break; 				case 'C':B_C++;break; 				default:break; 			} 		} 	} 	 	printf("%d %d %d\n",win, draw, lose); 	printf("%d %d %d\n",lose, draw, win); 	 	Max_A = (A_C>A_J)?A_C:A_J; 	Max_A = (Max_A>A_B)?Max_A:A_B; 	Max_B = (B_C>B_J)?B_C:B_J; 	Max_B = (Max_B>B_B)?Max_B:B_B; 	 	if (Max_A == A_B) 	{ 		printf("B "); 	} 	else if (Max_A == A_C) 	{ 		printf("C "); 	} 	else if (Max_A == A_J) 	{ 		printf("J "); 	} 	 	if (Max_B == B_B) 	{ 		printf("B"); 	} 	else if (Max_B == B_C) 	{ 		printf("C"); 	} 	else if (Max_B == B_J) 	{ 		printf("J"); 	} 	 	return 0; } 

  

RRR

标签
易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!