zoukankan      html  css  js  c++  java
  • 2016 ACM/ICPC Asia Regional Qingdao Online 1005 Balanced Game

    题目链接:

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

    Problem Description
    Rock-paper-scissors is a zero-sum hand game usually played between two people, in which each player simultaneously forms one of three shapes with an outstretched hand. These shapes are "rock", "paper", and "scissors". The game has only three possible outcomes other than a tie: a player who decides to play rock will beat another player who has chosen scissors ("rock crushes scissors") but will lose to one who has played paper ("paper covers rock"); a play of paper will lose to a play of scissors ("scissors cut paper"). If both players choose the same shape, the game is tied and is usually immediately replayed to break the tie.

    Recently, there is a upgraded edition of this game: rock-paper-scissors-Spock-lizard, in which there are totally five shapes. The rule is simple: scissors cuts paper; paper covers rock; rock crushes lizard; lizard poisons Spock; Spock smashes scissors; scissors decapitates lizard; lizard eats paper; paper disproves Spock; Spock vaporizes rock; and as it always has, rock crushes scissors.

    Both rock-paper-scissors and rock-paper-scissors-Spock-lizard are balanced games. Because there does not exist a strategy which is better than another. In other words, if one chooses shapes randomly, the possibility he or she wins is exactly 50% no matter how the other one plays (if there is a tie, repeat this game until someone wins). Given an integer N , representing the count of shapes in a game. You need to find out if there exist a rule to make this game balanced.
     
    Input
    The first line of input contains an integer t, the number of test cases. t test cases follow.
    For each test case, there is only one line with an integer N (2N1000) , as described above.

    Here is the sample explanation.

    In the first case, donate two shapes as A and B. There are only two kind of rules: A defeats B, or B defeats A. Obviously, in both situation, one shapes is better than another. Consequently, this game is not balanced.

    In the second case, donate two shapes as A, B and C. If A defeats B, B defeats C, and C defeats A, this game is balanced. This is also the same as rock-paper-scissors.

    In the third case, it is easy to set a rule according to that of rock-paper-scissors-Spock-lizard.
     
    Output
    For each test cases, output "Balanced" if there exist a rule to make the game balanced, otherwise output "Bad".
     
    Sample Input
    3
    2
    3
    5
     
    Sample Output
    Bad
    Balanced
    Balanced
     
    Hint:

    题意:

    nnn 个手势的石头剪刀布游戏是否能保证出每种手势胜率都一样。

    题解:

    当每种手势的攻防个数完全相等才能保证平衡,所以容易得出 nnn 是奇数时游戏平衡,否则不平衡。签到题。

    代码:

    #include <cstdio>
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            int n;
            scanf("%d",&n);
            if(n%2==1)
                printf("Balanced
    ");
            else
                printf("Bad
    ");
        }
    }
    

      

     
  • 相关阅读:
    SpannableString
    Java 之 FileReader FileInputStream InputStreamReader BufferedReader 作用与区别
    Java 之 File
    android 获取配置文件 相对路径
    Canvas
    Java Set List Map
    Comparable与Comparator区别
    HashMap HashTable ConcurrentHashMap
    centos7 mongodb 3.4 yum 安装
    对于JAVA程序优化的一些想法,读书有感.治疗强迫症良药
  • 原文地址:https://www.cnblogs.com/TAT1122/p/5879534.html
Copyright © 2011-2022 走看看