zoukankan      html  css  js  c++  java
  • POJ 2017 No Brainer(超级水题)

    一、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.

    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".
    二、题解
            只做为工作记录,不多说。
    三、Java代码
    import java.util.Scanner; 
    
    public class Main {
    	
        public static void main(String[] args) { 
           Scanner cin = new Scanner(System.in);
           int n,i,a,b;
           n=cin.nextInt();
           for(i=1;i<=n;i++){
        	   a=cin.nextInt();
        	   b=cin.nextInt();
        	   if(a>=b)
        		   System.out.println("MMM BRAINS");
        	   else
        		   System.out.println("NO BRAINS");
           }
        } 
      } 


    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    jvM垃圾回收
    Java快速失败和安全失败
    方法覆盖和方法重载
    leetcode-Reverse Words in a String
    自己玩玩
    leetcode-Reverse Vowels of a String
    leetcode-Reverse String
    leetcode-Multiply Strings
    java多线程-cas及atomic
    @media响应式布局
  • 原文地址:https://www.cnblogs.com/AndyDai/p/4734186.html
Copyright © 2011-2022 走看看