【算法笔记】B1052 卖个萌

题目链接：https://pintia.cn/problem-sets/994805260223102976/problems/994805273883951104

 #include <math.h>
 #include <stdio.h>

 char hand[][],eye[][],mouse[][];

 int  get_symbol(char p[][]) //返回符号数
 {
     char c,i=,j=;
     while( (c=getchar()) !='\n')
     {
         if( c == '[')//进入
         {
             while( (c=getchar()) != ']' )//退出
             {
                 if(c == '\n') //读取到换行符返回
                     return (i-);
                 p[i][j] = c;
                 j++;

             }
             p[i][j] = '\0';
             i++;
             j=;
         }
     }
     return (i-);
 }

 main()
 {
     int hand_count,eye_count,mouse_count;
     int n,i,a1,a2,a3,a4,a5;
     hand_count = get_symbol(hand); //统计数量，接收符号
     eye_count = get_symbol(eye);
     mouse_count = get_symbol(mouse);
     scanf("%d",&n);
     for(i=;i<n;i++)
     {
         scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5);
         //判断越界
         if(a1- > hand_count || a5- > hand_count || a2- > eye_count || a4- > eye_count || a3- > mouse_count) //注意下标越界的情况
         {
             puts("Are you kidding me? @\\/@");
         }
         else if
             (a1 <  || a2 <  || a3 <  || a4 <  || a5 < )
         {
             puts("Are you kidding me? @\\/@");
         }
         else
         {
             printf("%s(%s%s%s)%s\n",hand[a1],eye[a2],mouse[a3],eye[a4],hand[a5]);
         }
     }

     return ;
 }