zoukankan      html  css  js  c++  java
  • HDU 2164 Rock, Paper, or Scissors?

    http://acm.hdu.edu.cn/showproblem.php?pid=2164

    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 <bits/stdc++.h>
    using namespace std;
    
    char p1[1111], p2[1111];
    
    int cmp(char a, char b) {
    
        if(a == 'S') {
            if(b == 'P') return 2;
            if(b == 'R') return 1;
        }
    
        if(a == 'R') {
            if(b == 'S') return 2;
            if(b == 'P') return 1;
        }
    
        if(a == 'P') {
            if(b == 'R') return 2;
            if(b == 'S') return 1;
        }
    }
    
    int main() {
        int T;
        scanf("%d", &T);
        while(T --) {
            int x;
            scanf("%d", &x);
            int cnt = 0, ans = 0;
            getchar();
            for(int i = 1; i <= x; i ++) {
                scanf("%c %c", &p1[i], &p2[i]);
                getchar();
                if(cmp(p1[i], p2[i]) == 2)
                    cnt ++;
                else if(cmp(p1[i], p2[i]) == 1)
                    ans ++;
            }
    
            if(cnt > ans)
                printf("Player 1
    ");
            else if(cnt == ans)
                printf("TIE
    ");
            else
                printf("Player 2
    ");
        }
        return 0;
    }
    

      

     
  • 相关阅读:
    20200311 1. 消息中间件概述
    20200311 0. RabbitMQ 安装
    20210309 java.lang.Integer
    20210304. Redis【归档】
    20210304. 8. Redis 大厂面试汇总
    20210304. 7. Redis 企业实战
    20210304. 6. Redis 高可用方案
    20210304. 5. Redis 扩展功能
    Evolution Strategies as a Scalable Alternative to Reinforcement Learning
    脉冲神经网络研究现状及展望——论文摘抄
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9417374.html
Copyright © 2011-2022 走看看