Hotel

Problem Description

Last year summer Max straveled to California for his vacation. He had a great time there: took many photos, visited famous universities, enjoyed beatiful beaches and tasted various delicius foods. It is such a good trip that Max plans to travel there one more time this year. Max is satisfied with the accommodation of the hotel he booked last year but he lost the card of that hotel and can not remember quite clearly what its names is. So Max searched in web for the information of hotels in California and got piles of choice. Could you help Max pick out those that might be the right hotel?

Input

Input may consist of several test data sets. For each data set, it can be format as below:
For the first line, there is one string consist of ‘*’, ‘?’ and ‘a’-‘z’ characters. This string represents the hotel name that Max can remember. The ‘*’ and ‘?’ is wildcard characters. ‘*’ matches zero or more lowercase character(s), and ‘?’ matches only one lowercase character.
In the next line there is one integer n (1<=n<=10000) representing the number of hotel Max found, and then n lines follow. Each line contains one string of lowercase character(s), the name of the hotel.
The length of every string doesn’t exceed 50. 

Output

For each test data set, just simply output one integer in a line telling the number of hotel in the list whose name matches the one Max remembered.

Sample Input

herbert
2
amazon
herbert
?ert*
2
amazon
herbert
*
2
amazon
anything
hertber?
2
amazon
herber

Sample Output

1
1
2
0

#include <stdio.h>
#include <string.h>
char s[10010][51];
char t[51];

int match(char *s,char *t,int st,int se,int m,int n)
{
    int i,j,k;
    if(st == m && se == n) return 1;
    i = st;
    j = se;
    while(i < m && j < n)
    {
        if(s[i] == t[j]||s[i]=='?')
        {
            i ++;
            j ++;
        }
        else if(s[i]=='*')
        {
            for(k = j; k <= n; k ++)
            {
                if(match(s,t,i+1,k,m,n)) return 1;
            }
            break;
        }
        else return 0;
    }
    if(i == m && j == n)
        return 1;
    return 0;
}

int main()
{
    int i,n,tt,m,ans,n1;
    while(scanf("%s",t)!=EOF)
    {
        scanf("%d",&n);
        for(i = 1; i <= n; i ++)
            scanf("%s",s[i]);
        ans = 0;
        for(i = 1; i <= n; i ++)
        {
            m = strlen(s[i]);
            n1 = strlen(t);
            if(match(t,s[i],0,0,n1,m)) ans ++;
        }
        printf("%d\n",ans);
    }

    return 0;
}