Preparing NOJ

Hotel

2000ms 65536K

Description:

Last year summer Max traveled to California for his vacation. He had a great time there: took many photos, visited famous universities, enjoyed beautiful beaches and tasted various delicious foods. It is such a good trip that Max plans to traveled there one more time this year. Maxis 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 name is. So Max searched in the web for the information of hotels in California and got piles of choices. 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 consisting 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
hertert
*
2
amazon
anything
hertber?
2
amazon
herber

Sample Output:

1
1
2
0

Note:

本题由旧版NOJ导入,来源:第九届中山大学程序设计竞赛预选题

Info

NOJ

Provider NOJ

Code NOJ1124

Tags

Submitted 3

Passed 1

AC Rate 33.33%

Date 04/20/2019 10:03:10

Related

Nothing Yet