计蒜客作弊揭发者（A1007）

题目链接 https://nanti.jisuanke.com/t/A1007

#include<stdio.h>
#include<string.h>

int main()
{
    char  s[9], a[1000][9];
    int c[1000];
    int flag,n,i,j,count = 0;
    int k = 0;
    gets(s);
    scanf("%d",&n);
    getchar();
    for (i = 0;i < n;i++)
    {
            gets(a[i]);
    }
    for (i = 0; i < n; i++)
    {
        flag = 0;
        for (j = 0; j < 9; j++)
        {
            if (s[j] != '*')
            {
                if (s[j] != a[i][j])
                {
                    flag = 1;
                    break;
                }
            }
        }
        if (flag == 0)
        {
            count++;
            c[k++] = i;
        }
    }
    printf("%d\n",count);
    for (i = 0; i < k; i++)
    {
        for (j = 0; j < 9; j++)
        {
           printf("%c",a[c[i]][j]);
        }
        printf("\n");
    }
    return 0;
}