zjuoj 3610 Yet Another Story of Rock-paper-scissors

4890 ワード

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3610
Yet Another Story of Rock-paper-scissors
Time Limit: 2 Seconds      
Memory Limit: 65536 KB
Akihisa and Hideyoshi were lovers. They were sentenced to death by the FFF Inquisition. Ryou, the leader of the FFF Inquisition, promised that the winner of Rock-paper-scissors would be immune from the punishment. Being lovers, Akihisa and Hideyoshi decided to die together with their fists clenched, which indicated rocks in the game. However, at the last moment, Akihisa chose paper and Hideyoshi chose scissors. As a result, Akihisa was punished by the FFF Inquisition and Hideyoshi survived alone.
When a boy named b and a girl named g are being punished by the FFF Inquisition, they will play Rock-paper-scissors and the winner will survive. If there is a tie, then neither of they will survive. At first, they promise to choose the same gesture x. But actually, the boy wants to win and the girl wants to lose. Of course, neither of them knows that the other one may change his/her gesture. At last, who will survive?
Input
There are multiple test cases. The first line of input is an integer T ≈ 1000 indicating the number of test cases.
Each test case contains three strings -- b g x. All strings consist of letters and their lengths never exceed 20. The gesture x is always one of  "rock""paper"  and  "scissors" .
Output
If there is a tie, output  "Nobody will survive" . Otherwise, output  "y will survive"  where y is the name of the winner.
Sample Input
1

Akihisa Hideyoshi rock


Sample Output
Hideyoshi will survive


Author: WU, ZejunContest: The 9th Zhejiang Provincial Collegiate Programming Contest
 
分析:
タイトルは勝者の名前を出力すればよい.テーマを分析してみると、約束が実現しても何でも女子が勝つので、2人目の勝ちを直接出力すればいいということです.
 
ACコード:

 1 #include<cstdio>

 2 #include<algorithm>

 3 #include<cstring>

 4 #include<queue>

 5 #include<iostream>

 6 #include<stack>

 7 #include<map>

 8 #include<string>

 9 using namespace std;

10 char name1[50], name2[50], type1[50];

11 int main(){

12     int n;

13     scanf("%d", &n);

14     while(n--){

15         scanf("%s%s%s", name1, name2, type1);

16         printf("%s will survive
", name2); 17 } 18 return 0; 19 }

View Code