OpenJudge/Poj 2027 No Brainer

1.链接地址：

http://bailian.openjudge.cn/practice/2027

http://poj.org/problem?id=2027

2.题目：

总Time Limit:

1000ms

Memory Limit:

65536kB
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
Source

South Central USA 2004

3.思路：

4.代码：

 1 #include<iostream>
 2 using namespace std;
 3 int main()
 4 {
 5     int n;
 6     cin>>n;
 7     int a,b;
 8     int i;
 9     for(i=0;i<n;i++)
10     {
11         cin>>a>>b;
12         if(a>=b) cout<<"MMM BRAINS"<<endl;
13         else cout<<"NO BRAINS"<<endl;
14     }
15     //system("pause");
16        return 0;
17 }

转载于:https://www.cnblogs.com/mobileliker/p/3584541.html

OpenJudge/Poj 2027 No Brainer相关推荐

POJ 2027 No Brainer（水~）
Description 输入x,y,如果x< y,输出NO BRAINS,否则输出MMM BRAINS Input 第一行为用例组数,每组用例两个整数x和y Output 对于每组用例,按题意输 ...
OpenJudge/Poj 2001 Shortest Prefixes
1.链接地址: http://bailian.openjudge.cn/practice/2001 http://poj.org/problem?id=2001 2.题目: Shortest Pref ...
OpenJudge/Poj 1163 The Triangle
1.链接地址: http://bailian.openjudge.cn/practice/1163 http://poj.org/problem?id=1163 2.题目: 总时间限制: 1000ms ...
OpenJudge/Poj 1915 Knight Moves
1.链接地址: http://bailian.openjudge.cn/practice/1915 http://poj.org/problem?id=1915 2.题目: 总Time Limit: ...
OpenJudge/Poj 1226 Substrings
1.链接地址: http://bailian.openjudge.cn/practice/1226/ http://poj.org/problem?id=1226 2.题目: 总时间限制: 1000m ...
POJ 2017 No Brainer(超级水题)
一.Description Zombies love to eat brains. Yum. Input The first line contains a single integer n indi ...
c语言记忆化搜索,HNUSTC语言基础简单数据结构acm入门第一讲搜索.ppt
C语言基础,简单数据结构,ACM入门讲座搜索部分 Bjut:mark063 2010.10.30 1 Evaluation only. Created with Aspose.Slides for . ...
POJ的题目分类(两个版本)
版本一: 简单题 1000A+B Problem 1001Exponentiation 1003 Hangover 1004 Financial Management 1005 I Think I N ...
OpenJudge 2757 最长上升子序列 / Poj 2533 Longest Ordered Subsequence
1.链接地址: http://poj.org/problem?id=2533 http://bailian.openjudge.cn/practice/2757 2.题目: 总Time Limit: ...

OpenJudge/Poj 2027 No Brainer

OpenJudge/Poj 2027 No Brainer相关推荐

最新文章

热门文章