解题思路:
注意事项:
参考代码:
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
char player1[20],player2[20];
int i;
for(i=0;i<n;i++)
{
scanf("%s %s",player1,player2);
if(strcmp(player1,player2)==0)//双方出的相同
printf("Tie\n");
if(strcmp(player1,"Rock")==0&&strcmp(player2,"Scissors")==0)
printf("Player1\n");
if(strcmp(player1,"Rock")==0&&strcmp(player2,"Paper")==0)
printf("Player2\n");
if(strcmp(player1,"Scissors")==0&&strcmp(player2,"Paper")==0)
printf("Player1\n");
if(strcmp(player1,"Scissors")==0&&strcmp(player2,"Rock")==0)
printf("Player2\n");
if(strcmp(player1,"Paper")==0&&strcmp(player2,"Rock")==0)
printf("Player1\n");
if(strcmp(player1,"Paper")==0&&strcmp(player2,"Scissors")==0)
printf("Player2\n");
}
return 0;
}
方法二:只比较首字符
#include<stdio.h>
int main()
{
int n ;
scanf("%d",&n);
getchar();
char player1[20],player2[20];
for (int i=0;i<n;i++)
{
scanf("%s%s",player1,player2);
if(player1[0]==player2[0])
printf("Tie\n");
else if((player1[0]=='R'&&player2[0]=='S')||(player1[0]=='S'&&player2[0]=='P')||(player1[0]=='P'&&player2[0]=='R'))
printf("Player1\n");
else if((player1[0]=='R'&&player2[0]=='P')||(player1[0]=='S'&&player2[0]=='R')||(player1[0]=='P'&&player2[0]=='S'))
printf("Player2\n");
}
return 0;
}
方法三:
#include <stdio.h>
#include <string.h>
#define ROCK "Rock"
#define PAPER "Paper"
#define SCISSORS "Scissors"
int main() {
int n;
scanf("%d", &n);
char s1[100][9], s2[100][9]; // 增大数组长度,确保能存下 "Scissors"
for(int i = 0; i < n; i++) {
scanf("%s %s", s1[i], s2[i]);
}
for(int i = 0; i < n; i++) {
if(strcmp(s1[i], s2[i]) == 0) {
printf("Tie\n");
}
else if( (strcmp(s1[i], ROCK) == 0 && strcmp(s2[i], SCISSORS) == 0) ||
(strcmp(s1[i], PAPER) == 0 && strcmp(s2[i], ROCK) == 0) ||
(strcmp(s1[i], SCISSORS) == 0 && strcmp(s2[i], PAPER) == 0) ) {
printf("Player1\n");
}
else {
printf("Player2\n");
}
}
return 0;
}
0.0分
0 人评分
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程,并配有习题和答疑,点击了解:
一点编程也不会写的:零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码?手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程:算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程
发表评论 取消回复