zoukankan      html  css  js  c++  java
  • [ACM_水题] Yet Another Story of Rock-paper-scissors [超水 剪刀石头布]

    Description

    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 -- bgx. 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

    题目大意:T种情况,A,B两人商量好同时出剪刀石头或布,结果A想赢,B想输,输出最终谁赢。
    解题思路:B赢

     1 #include<iostream>
     2 #include<string.h>
     3 #include<cstring>
     4 #include<string>
     5 using namespace std;
     6 int main(){
     7     int T;cin>>T;
     8     while(T--){
     9         string str1,str2,str3;
    10         cin>>str1>>str2>>str3;
    11         cout<<str2<<" will survive
    ";
    12     }return 0;
    13 }



  • 相关阅读:
    [原]小巧的刀片
    [原]看康震教授讲《卖油翁》有感
    [原]使用可传输表空间修改Schema Name
    [原]ORA00060: Deadlock detected(场景1:单表并发更新)
    [原]使用wget/curl做个“小后门”
    [原]一个空格导致NFS的Readonly
    [转]设计高效SQL: 一种视觉的方法
    [原]6Gb/s SAS 2.0 通道的确不错
    ESX 4/VSphere CentOS 启动时 udev Hang 住
    [摘]终于找到一个有助理解left/right/full outer join的例子
  • 原文地址:https://www.cnblogs.com/zjutlitao/p/3603552.html
Copyright © 2011-2022 走看看