zoukankan      html  css  js  c++  java
  • HDU2164:Rock, Paper, or Scissors?

    Problem Description
    Rock, Paper, Scissors is a two player game, where each player simultaneously chooses one of the three items after counting to three. The game typically lasts a pre-determined number of rounds. The player who wins the most rounds wins the game. Given the number of rounds the players will compete, it is your job to determine which player wins after those rounds have been played.  

    The rules for what item wins are as follows:

    ?Rock always beats Scissors (Rock crushes Scissors)
    ?Scissors always beat Paper (Scissors cut Paper)
    ?Paper always beats Rock (Paper covers Rock)  
     
    Input
    The first value in the input file will be an integer t (0 < t < 1000) representing the number of test cases in the input file. Following this, on a case by case basis, will be an integer n (0 < n < 100) specifying the number of rounds of Rock, Paper, Scissors played. Next will be n lines, each with either a capital R, P, or S, followed by a space, followed by a capital R, P, or S, followed by a newline. The first letter is Player 1抯 choice; the second letter is Player 2抯 choice.

     
    Output
    For each test case, report the name of the player (Player 1 or Player 2) that wins the game, followed by a newline. If the game ends up in a tie, print TIE.
     
    Sample Input
    3 2 R P S R 3 P P R S S R 1 P R
     
    Sample Output
    Player 2 TIE Player 1
     


    狂刷水题

    我都不好意思做解题报告了

    #include <stdio.h>
    
    int fun(char a,char b)
    {
        if((a == 'R' && b == 'S') || (a == 'S' && b == 'P') || (a == 'P' && b == 'R'))
        return 1;
        return 0;
    }
    
    int main()
    {
        int n,m;
        char a,b;
        scanf("%d",&m);
        while(m--)
        {
            int suma = 0,sumb = 0;
            scanf("%d%*c",&n);
            while(n--)
            {
                scanf("%c %c",&a,&b);
                getchar();
                suma+=fun(a,b);
                sumb+=fun(b,a);
            }
            if(suma > sumb)
            printf("Player 1\n");
            else if(suma == sumb)
            printf("TIE\n");
            else
            printf("Player 2\n");
        }
    }
    


     

  • 相关阅读:
    【LeetCode】306. Additive Number
    【LeetCode】49. Group Anagrams
    【LeetCode】233. Number of Digit One
    【LeetCode】73. Set Matrix Zeroes
    【LeetCode】284. Peeking Iterator
    【LeetCode】241. Different Ways to Add Parentheses
    【LeetCode】289. Game of Life
    新版Java为什么要修改substring的实现
    计算机中整数加法满足结合律吗
    双色球中奖概率分析
  • 原文地址:https://www.cnblogs.com/javawebsoa/p/3014138.html
Copyright © 2011-2022 走看看