POJ 2027 No Brainer

简介: POJ 2027 No Brainer

Problem 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


简单的比大小。。。

#include <stdio.h>
#include <stdlib.h>
int main(){
    int c;
    scanf("%d",&c);
    while(c--){
            int x,y;
    scanf("%d %d",&x,&y);
    if(x<y)
        printf("NO BRAINS\n");
    else
        printf("MMM BRAINS\n");
    }
    return 0;
}
目录
相关文章
|
6月前
|
算法
Highways(POJ—2485)
Highways(POJ—2485)
|
人工智能
POJ 3104 Drying
POJ 3104 Drying
|
C语言
poj 2503 查字典
Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language.
866 0
poj 3664
http://poj.org/problem?id=3664 进行两轮选举,第一轮选前n进入第二轮,第二轮选最高   #include #include using namespace std; struct vote { int a,b; int c; ...
735 0
|
算法 数据建模 机器学习/深度学习
poj-3094-quicksum
http://poj.org/problem?id=3094 很简单 #include #include using namespace std; int main() { string a; int sum=0; while(getline(cin...
576 0
|
并行计算 网络架构
poj-1005-l tanink i need a houseboat
Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned ...
986 0
poj-2551-ones
Description Given any integer 0
773 0