文件中字符串的匹配判断输出的问题,怎么正确地运用 C语言的程序设计语言的编写代码的方式解决思想

Problem Description
WisKey downloaded much software in winter vacation, and the disk was in a state of confusion. He wastes many times to find the file everyday. So he wants a tool to help him do this work.
The file name consists of lowercase letters.
The name pattern is a string of lowercases, '?'s and '*'s. In a pattern, a '?' matches any single lowercase, and a '*' matches none or more lowercases.
Let’s do this~

Input
The first line of input contains two integers N (0 < N <= 10000) and M (0 < M <=100), representing the number of file names and the number of word patterns.
Each of the following N lines contains a file name. After those, each of the last M lines contains a name pattern.
You can assume that the length of patterns will not exceed 6, and the length of file names will not exceed 20.
There are multiple cases in the data file, process to end of file.

Output
For each pattern, print a line contains the number of matched file names.
If there is no file name that can match the pattern, print "Not match".

Sample Input
4 5
this
the
an
is
t*
?h*s
??e*
*s
e

Sample Output
2
1
1
2
Not match

表达式匹配,动态规划啊

使用正在表达式的方案应该不行,因为C语言不支持正则表达式,建议使用C语言自带的字符串处理函数进行逻辑判断或遍历处理。