一本通1132

一本通1132

#include <bits/stdc++.h>
#define rep(i,j,n) for(register int i=j;i<=n;i++)
#define Rep(i,j,n) for(register int i=j;i>=n;i--)
#define low(x) x&(-x)
using namespace std ;
typedef long long LL ;
const int inf = INT_MAX >> 1 ;
inline LL In() { LL res(0) , f(1) ; register char c ;
#define gc c = getchar()
    while(isspace(gc)) ; c == '-' ? f = - 1 , gc : 0 ;
    while(res = (res << 1) + (res << 3) + (c & 15) , isdigit(gc)) ;
    return res * f ;
#undef gc
}

int t ;
inline void Ot() {
    t = In() ;
    while(t --){
        string s1 , s2 ;
        cin >> s1 >> s2 ;
        int x , y ;
        if(s1 == "Scissors") x = 0 ;
        if(s1 == "Rock") x = 1 ;
        if(s1 == "Paper") x = 2 ;
        if(s2 == "Scissors") y = 0 ;
        if(s2 == "Rock") y = 1 ;
        if(s2 == "Paper") y = 2 ;
        if(x == y) {
            puts("Tie") ;
            continue ;
        }
        if(x - y == 1 or x - y == -2) {
            puts("Player1") ;
            continue ;
        }
        if(y - x == 1 or y - x == -2) {
            puts("Player2") ;
            continue ;
        }
    }
}
signed main() {
//  freopen("test.in","r",stdin) ;
    return Ot() , 0 ;
}
posted @ 2019-04-13 01:02 breezeღ 阅读( ...) 评论( ...) 编辑 收藏

猜你喜欢

转载自blog.csdn.net/qq_42628055/article/details/89346804
今日推荐