Hi. I got AC at this problem before, but now I guess they added some more tests and i get WA. I tested the program with the testcases on this forum and it works fine.

The masks in the example and tests don't really go with the text of the problem. The text lists some special strings in masks, but says nothing about combining them (so for example [a-zA-z] shouldn't even be a special string in a mask from the problem text). It is therefore clear that the problem statement should be more specific about how we should handle special masks. In spite of this, you specifically add different combinations to the tests, combinations we need to learn how to handle by doing lots and lots of submissions. Examples of unclear masks are '[ab]c]', '[^-z]', '[a-zZ]'. The last one '[a-zZ]' by following the statement to the letter should be interpreted: any of the 'a', '-', 'z' or 'Z' characters.

I will never understand why do you think that a simple problem suddenly becomes interesting when 90% of the submissions are WA.

Some hints for you:
 • There are no tests like '[b-a]' and '[^]', they are incorrect
 • Special characters '[', '%' and '_' mean themselves when included in brackets. That is:

'[' like '[[]' => YES
'%' like '[%]' => YES
'_' like '[_]' => YES

but:

']' like ']' => YES
'^' like '^' => YES


Edited by author 05.08.2004 12:34

My program works on these tests. Thank you anyway. But if no new tests were added, how come my program that once had AC now gets WA? Maybe there is a bug in my program that only came out with the new complier (it is a new compiler right?)... case in which I apologize.

Sorry, my bad. I fixed it now.