【算法笔记】B1052 卖个萌

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

#include <math.h>
#include <stdio.h>
 
char hand[10][5],eye[10][5],mouse[10][5];
 
int  get_symbol(char p[][5]) //返回符号数
{
    char c,i=0,j=0;
    while( (c=getchar()) !='
')
    {
        if( c == '[')//进入
        {
            while( (c=getchar()) != ']' )//退出
            {
                if(c == '
') //读取到换行符返回   
                    return (i-1);
                p[i][j] = c;
                j++;
 
            }
            p[i][j] = ''; 
            i++;
            j=0;
        }
    }
    return (i-1);
}
 
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=0;i<n;i++)
    {
        scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5);
        //判断越界 
        if(a1-1 > hand_count || a5-1 > hand_count || a2-1 > eye_count || a4-1 > eye_count || a3-1 > mouse_count) //注意下标越界的情况
        {
            puts("Are you kidding me? @\/@");
        }
        else if
            (a1 < 0 || a2 < 0 || a3 < 0 || a4 < 0 || a5 < 0) 
        {
            puts("Are you kidding me? @\/@");
        }
        else
        {
            printf("%s(%s%s%s)%s
",hand[a1],eye[a2],mouse[a3],eye[a4],hand[a5]);
        }
    }
 
    return 0;
}