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】500. Keyboard Row
    【排序算法汇总】5类8种排序算法
    【leetcode】339. Nested List Weight Sum
    ArcCatalog中将SQLServer中的空间数据导入到Oracle库中
    初学ArcGIS API for JavaScript
    ArcGIS API for JavaScript开发环境配置
    shapefile与gdb中不能允许存在的几何错误
    C#中的Dictionary字典类介绍(转载)
    泛型Dictionary<string,string>的用法
    空间数据存储格式wkb和wkt(转载)
  • 原文地址:https://www.cnblogs.com/javawebsoa/p/3014138.html
Copyright © 2011-2022 走看看