http://noi.openjudge.cn/ch0107/04/
/*
1.7编程基础之字符串_04石头剪子布
http://noi.openjudge.cn/ch0107/04/
*/
#include<iostream>
using namespace std;
int main()
{
int n,i,j,k;
char a[101],b[101];
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a>>b; //分别输入字符串a和b
if(a[0]=='R'&&b[0]=='S'
||a[0]=='S'&&b[0]=='P'
||a[0]=='P'&&b[0]=='R') //只需判断第一字母
cout<<"Player1"<<endl;
else if(a[0]==b[0])
cout<<"Tie"<<endl;
else
cout<<"Player2"<<endl;
}
return 0;
}
/*
NOI / 1.7编程基础之字符串 STL
04石头剪子布 2021.11.28 AC
http://noi.openjudge.cn/ch0107/solution/31685699/
*/
#include<iostream>
#include<string>
using namespace std;
int num[26]={};
int Result(string one,string two)
{
if((one=="Scissors"&&two=="Paper")||(one=="Paper"&&two=="Rock")||(one=="Rock"&&two=="Scissors"))
{
return 1;
}
else if(one==two)
{
return 0;
}
else
{
return 2;
}
}
int main()
{
int n;cin>>n;
string one;
string two;
for(int i=0;i<n;++i)
{
cin>>one>>two;
int c=Result(one,two);
if(c==1)
{
cout<<"Player1\n";
}
else if(c==2)
{
cout<<"Player2\n";
}
else
{
cout<<"Tie\n";
}
}
return 0;
}
/*
1.7编程基础之字符串_04石头剪子布
http://noi.openjudge.cn/ch0107/04/
*/
#include<cstring>
#include<iostream>
using namespace std;
int main()
{
string a,b;
int n;
cin>>n;
int i;
for(i=1;i<=n;i++)
{
cin>>a>>b;
if(a==b)
{
cout<<"Tie\n";
}
else
{
if( (a=="Rock" && b=="Scissors") || (a=="Scissors"&&b=="Paper") ||
(a=="Paper"&&b=="Rock") )
{
cout<<"Player1\n";
}
else
{
if( (a=="Rock"&&b=="Paper") || (a=="Paper"&&b=="Scissors") ||
(a=="Scissors"&&b=="Rock") )
{
cout<<"Player2\n";
}
}
}
}
return 0;
}