zoukankan      html  css  js  c++  java
  • poj 2027 No Brainer

    No Brainer
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 25329   Accepted: 16554

    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".

    Sample Input

    3
    4 5
    3 3
    4 3
    

    Sample Output

    NO BRAINS
    MMM BRAINS
    MMM BRAINS
    
     1 #include<iostream>  
     2 #include<string.h>  
     3 #include<stdio.h>  
     4 #include<ctype.h>  
     5 #include<algorithm>  
     6 #include<stack>  
     7 #include<queue>  
     8 #include<set>  
     9 #include<math.h>  
    10 #include<vector>  
    11 #include<map>  
    12 #include<deque>  
    13 #include<list>  
    14 using namespace std;
    15 int main()  
    16 {
    17     int n;
    18     cin>>n;
    19     while(n--)
    20     {
    21         int a,b;
    22         cin>>a>>b;
    23         if(a>=b)
    24         printf("MMM BRAINS
    ");
    25         else
    26         printf("NO BRAINS
    ") ;
    27     }
    28     return 0;
    29 }   
    View Code
  • 相关阅读:
    75. InputStreamReader和OutputStreamWriter(转换流--字节流转换成字符流)
    74. 编码与解码
    73. PrintStream(打印流)
    72.Properties(配置文件)
    71 Serializable(序列化和反序列化)
    70. SequenceInputStream(文件合并)
    Rabin-Karp指纹字符串查找算法
    优先队列
    版本管理工具svn简介
    php 2038年问题
  • 原文地址:https://www.cnblogs.com/qscqesze/p/3880199.html
Copyright © 2011-2022 走看看