ZZULI_SummerPractice(6)  POJ 202…

B - No Brainer _p

Time Limit: 1000MS

Memory Limit: 30000K

64bit IO Format: %I64d & %I64u

[Submit]   [Go Back]   [Status]

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 descri_ption:

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 

这道题我看来看去也没看出什么陷阱，但是提交的时候总是感觉题不会这么简单，后来一直等到提交了十几个并且没有一个人错误的时候才写了一种自认为万全的代码，结果竟然AC了，这题出的真失败，几乎没人错

代码：

#include<stdio.h>

#include<string.h>

int main()

{

       char str1[1002],str2[1002];

  char name1[1002],name2[1002];

        int i,len1,len2,t;

   scanf("%d",&t);

      while(t--)

   {

            scanf("%s%s",name1,name2);

           i=0;

         while(name1[i]=='0')i++;

             strcpy(str1,name1+i);

                i=0;

         while(name2[i]=='0')i++;

             strcpy(str2,name2+i);

                len1=strlen(str1);

           len2=strlen(str2);

           if(len1>len2)

                 printf("MMM BRAINS\n");

              else if(len1<len2)

                    printf("NO BRAINS\n");

               else{

                        if(strcmp(str1,str2)<0)

                               printf("NO BRAINS\n");

                       else printf("MMM BRAINS\n");

         }

    }

    return 0;

}