http://acm.hdu.edu.cn/showproblem.php?pid=2164
#include <bits/stdc++.h>
using namespace std;
char p1[1111], p2[1111];
int cmp(char a, char b) {
if(a == ‘S‘) {
if(b == ‘P‘) return 2;
if(b == ‘R‘) return 1;
}
if(a == ‘R‘) {
if(b == ‘S‘) return 2;
if(b == ‘P‘) return 1;
}
if(a == ‘P‘) {
if(b == ‘R‘) return 2;
if(b == ‘S‘) return 1;
}
}
int main() {
int T;
scanf("%d", &T);
while(T --) {
int x;
scanf("%d", &x);
int cnt = 0, ans = 0;
getchar();
for(int i = 1; i <= x; i ++) {
scanf("%c %c", &p1[i], &p2[i]);
getchar();
if(cmp(p1[i], p2[i]) == 2)
cnt ++;
else if(cmp(p1[i], p2[i]) == 1)
ans ++;
}
if(cnt > ans)
printf("Player 1\n");
else if(cnt == ans)
printf("TIE\n");
else
printf("Player 2\n");
}
return 0;
}
HDU 2164 Rock, Paper, or Scissors?
原文:https://www.cnblogs.com/zlrrrr/p/9417374.html