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.
Output
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.- 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- Sample Output
3 4 5 3 3 4 3- Source
NO BRAINS MMM BRAINS MMM BRAINS- 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 }