2201.cpp

浙江大学acm题代码答案,主要 是本人提交成功的题目.

/*No Brainer

--------------------------------------------------------------------------------

Time limit: 1 Seconds   Memory limit: 32768K
Total Submit: 1486   Accepted Submit: 1082

--------------------------------------------------------------------------------

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>
int print(int n)
{
    int a[n][2],i;
    for(i=0;i<n;i++)
        scanf("%d %d",&a[i][0],&a[i][1]);
    for(i=0;i<n;i++)
        if(a[i][0]>=a[i][1])
            printf("MMM BRAINS\n");
        else
            printf("NO BRAINS\n");
    return 0;
}

int main()
{
    int n;
    scanf("%d",&n);
    print(n);
    return 0;
}