zoukankan      html  css  js  c++  java
  • POJ 2027

    Description

    Zombies love to eat brains. Yum.

    Input

    The first line contains a single integer n indicating the number of data sets. 

    The following n lines each represent a data set. Each data set will be formatted according to the following description: 

    A single data set consists of a line "X Y", where X is the number of brains the zombie eats and Y is the number of brains the zombie requires to stay alive. 
    X是僵尸吃的脑子的数量,Y是僵尸维持活着状态下最少需要吃的脑子的数量。

    Output

    For each data set, there will be exactly one line of output. This line will be "MMM BRAINS" if the number of brains the zombie eats is greater than or equal to the number of brains the zombie requires to stay alive. Otherwise, the line will be "NO BRAINS".
    X>Y,僵尸吃的足够多,就MMM BRAINS,好次!
    X<Y,脑子不够次,就NO BRAINS,僵尸就NO LIFE!
    (神他喵翻译(@_@;) ……

    Sample Input

    3
    4 5
    3 3
    4 3
    

    Sample Output

    NO BRAINS
    MMM BRAINS
    MMM BRAINS
    

    Source

     
    水题一只。
     1 #include<stdio.h>
     2 int main()
     3 {
     4   int n,x,y;scanf("%d",&n);
     5   while(n){
     6     scanf("%d%d",&x,&y);
     7     if(x<y) printf("NO BRAINS
    ");
     8     else printf("MMM BRAINS
    ");
     9     n--;
    10   }
    11 }
    转载请注明出处:https://dilthey.cnblogs.com/
  • 相关阅读:
    64最长和谐子序列(594)
    63找到字符串中所有字母异位词(438)
    62有效的数独(36)
    10.10
    9.27作业
    9.27
    9.26
    9.25
    9.18学习内容
    9.17作业
  • 原文地址:https://www.cnblogs.com/dilthey/p/6804196.html
Copyright © 2011-2022 走看看