OpenJudge/Poj 2027 No Brainer
2014-12-04 13:06
288 查看
1.链接地址:
http://bailian.openjudge.cn/practice/2027 http://poj.org/problem?id=2027
2.题目:
总Time Limit:1000msMemory Limit:65536kBDescriptionZombies love to eat brains. Yum.InputThe 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. OutputFor 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
SourceSouth Central USA 2004
3.思路:
4.代码:
http://bailian.openjudge.cn/practice/2027 http://poj.org/problem?id=2027
2.题目:
总Time Limit:1000msMemory Limit:65536kBDescriptionZombies love to eat brains. Yum.InputThe 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. OutputFor 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
SourceSouth 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 }
相关文章推荐
- OpenJudge/Poj 2027 No Brainer
- POJ 2027 No Brainer(水~)
- OpenJudge/Poj 2013 Symmetric Order
- Poj 2109 / OpenJudge 2109 Power of Cryptography
- OpenJudge / POJ 1002 487-3279 解题报告 C++
- OpenJudge/Poj 1163 The Triangle
- OpenJudge/Poj 1664 放苹果
- OpenJudge 2803 碎纸机 / Poj 1416 Shredding Company
- OpenJudge/Poj 2001 Shortest Prefixes
- Poj 2503 / OpenJudge 2503 Babelfish
- Poj 2109 / OpenJudge 2109 Power of Cryptography
- OpenJudge/Poj 2105 IP Address
- POJ 2027 No Brainer
- Poj OpenJudge 百练 2602 Superlong sums
- OpenJudge/Poj 2105 IP Address
- Poj 2586 / OpenJudge 2586 Y2K Accounting Bug
- OpenJudge/Poj 1083 Moving Tables
- OpenJudge/Poj 1979 Red and Black / OpenJudge 2816 红与黑
- OpenJudge/Poj 1723 SOLDIERS
- POJ 1222 EXTENDED LIGHTS OUT (noi OpenJudge 1813)枚举