zoukankan      html  css  js  c++  java
  • Balanced Game HDU

    Time limit
    1000 ms
    Memory limit
    32768 kB

    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 (2≤N≤1000)
    , 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
    

    思路:
    奇数平衡,偶数不平衡。

    代码:

    #include <cstdio>
    #include <iostream>
    #include <algorithm>
    #include <cmath>
    #include <cstring>
    
    using namespace std;
    
    int main(){
        int N;
        cin>>N;
        while(N--){
            int a;
            scanf("%d",&a);
            if(a&1)printf("Balanced
    ");
            else printf("Bad
    ");
        }
        return 0;
    }
  • 相关阅读:
    Xamarin Forms 的一个小事故 dotNET界面
    求极限求无限数相加算法
    C# 获取鼠标位置
    入门级XML学习(三)
    DateTime 获取时间
    《人工智能的未来》经典语录
    VS编辑器 高亮消失如何恢复
    C# 获取桌面
    导出EXECL 2003正常 2007 不正常问题
    css 控制div高度自适应浏览器的高度
  • 原文地址:https://www.cnblogs.com/vocaloid01/p/9514250.html
Copyright © 2011-2022 走看看