Edited by author 27.02.2022 15:58

Input:
3
'╣' like '[╣-I]'
'╣' like '╣'
'╣' like '_'
Output:
YES
YES
YES

input:
1
'a-z' like 'a-z'

output:
YES

Edited by author 03.07.2019 23:01

Edited by author 03.07.2019 23:01

Hi,
I have tried like million times different combinations, and it always gives wrong answer, always on 6. case.

Does anyone have 6. case? Does any anyone have any idea what kind of strings/patterns are in 6. case?

Thanks in advance

Should I care of patterns with incomplete square braces? For example 'a[b' (and probably treat '[' as a regular character for matching. Or there is no such tests?

How to deal with case like this
' ' like ' like ' like ' like ' 'like '
it can be splitted as
( ) & ( like ' like ' like ' 'like ) or
( ' like ) & ( like ' like ' 'like ) or
( ' like ' like ) & ( like ' 'like ) or
( ' like ' like ' like ) & ( 'like )

Can you clarify this statement
Inner entrance of apostrophe symbol (ASCII 39) into string or template is encoded by double apostrophe symbol

And if it's true the case
''hi'' like ''hi''
will be changed to
'"hi'' like '"hi'
Am I right?

Then how is this case possible?
'''''' like '_'''

Hi,

My program pass all local tests but crashes after submit on test #3. Most probably I miss some boundary or weird pattern case. I use C++ and I took into account the fact that char's over 127 are converted to negative integers.

Do you have any hint?

if you get WA on test #2, then try to use unsigned char* instead char*

2
'like' like 'like'
''' '' ' like ''' ''%'

YES
YES

Tests may also have spaces, so it is a confusing question to determine how to get the string and the pattern.
I got 14 WA on this question, and finally AC. QWQ

Edited by author 14.10.2015 20:17

What are answers for following comparisions?

'[]' like '[]'
'' like '[]'

As this problem's statement is really hard to interpret unambiguously, I've decided to make this attempt to explain my view on it, which seems to be the one that authors meant.
 Here’s the list of notes that make the problem more clear:

in template:
1. Brackets ‘[]’ have the highest priority. Find the leftmost ‘[‘, then find the first ‘]’ after it; you can assume that these two brackets strictly correspond to each other, i.e. can’t be considered to correspond to any other brackets. Then find the first opening bracket after current closing one and so on.
2. Such templates, as [] and [^] are incorrect and don’t happen in test cases.
3. Given an opening bracket [ and a corresponding closing bracket ], let’s consider the string S between them. As Vladimir Yakovlev already stated, special characters '[', '%' and '_' mean themselves when included in brackets. Now, let’s describe a boolean function F(c,s), that determines whether template s matches character c. "Del(s,k)" will denote a function, that returns the tail of s starting from position k+1 inclusively. We shall also need a boolean function G:

F:
If s[1]='^', Then F(c,s):=Not G(c,Del(s,1)), Else F(c,s):=G(c,s)

G:
If s[2]='–' and length(s)>=3 Then G(c,s):=G(c,Del(s,3)) Or (s[1]<=c<=s[3])
            Else G(c,s)=G(c,Del(s,1)) Or (s[1]=c)

To my mind, these rules do make the problem statement clear and have nothing to deal with posting Source code, so I hope moderators won’t delete this message. I also want to say thank you to the person posting under nick "I have answers to all your questions :)" for helping people on this problem. In fact, your posts helped me to understand it.

The problem unexpectedly dosn't contain very tricky tests.
Additionally to forum's examples I add the next:
1. Empty string corresponds with '%%%%%%%%' and so on and
with empty pattern also;
2. 'a'~'%a'
3. String may contain many "like" substrings . For defining
right position dublicable inner '-characters play key role;
4. Dp-method is veru useful, when we are going from ends of strings to their beginnings.

Edited by author 11.07.2007 17:24

'ab' like '[a]b'
'ab' like '%b'
'ab' like '%%b'
'ab' like '%%%b'
'ab' like '%%%b%'
'ab' like '%%%b%%'
'b' like '%%'

Edited by author 01.09.2010 00:37

What is the right answer for the given string?

When reading the input, like this:

char *Input;
cin.getline(...);

the chars with ASCII code larger than 127 will become negative integers, for example, if the ASCII code is SUPPOSED to be 160, it will turn out to be 160-128.

Fix this trick, and you will get AC.

One more, this article will help you VERY MUCH if you don't really understand the problem statements.

http://acm.timus.ru/forum/thread.aspx?space=1&num=1177&id=10577&upd=632900666745579610

(It can be found just on the BOARD.)

GOOD LUCK~

Contradictions:
''' like ' like '''
'a' like '[a^a]'
'#' like '!--0'
'd' like 'a-c-e'
and so forth ...
In the condition you need to specify that these tests are not available.

I don't know how to solve it, but I got AC because C#'s regular expression engine knows ;)

Any idea why I could get WA 4 ?

All the tests I gave were ok.

Edited by author 16.04.2010 23:25