No Brainer
Time Limit: 1000MS | Memory Limit: 30000K |
Total Submissions: 7468 | Accepted: 5631 |
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.
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
'PKU & UVa problems > Original problem' 카테고리의 다른 글
PKU 2649: Factovisors (0) | 2008.09.30 |
---|---|
PKU 1844. Sum. (0) | 2008.09.22 |
PKU [3685]. Matrix. (0) | 2008.09.17 |
PKU 2017, Speed Limit. (0) | 2008.09.11 |
UVa. 112, PKU 1145. Tree Summing. (1) | 2008.09.02 |