Wildcard Matching

The less than symbols are broken. Again.

It also says that the length of the wildcard pattern does not exceed 5, yet the test cases show otherwise. Please fix.

Can this please be fixed?

As Stephen indicated, '*c*' does not match 'Worldcup2010' if '*' matches only up to 5 chars, therefore '*c*' should show '2' matches only.

Uh, no, it doesn't say anything about how many characters * can match. Just that the length of the wildcard string is at most 5, whereas *?*?*?*? is of length 8.

The problem statement has been updated.

Argh... There seems to something fishy with the judge's output/checker. I've verified my program with large testcases locally, with grep, and it gives correct output. But the judge refuses to accept ;-) And no one else has been able to get an AC on this one either.

To restate the obvious: (1) the matching (of non-wildcards) should be case-sensitive (2) * matches any number (including 0 or greater than 5) characters (3) Both * and ? match any character from the sets [A-Z], [a-z], [0-9].

if the input is

1

1 1

abaca

*ac*

what will be the output

*ac* 1

or

*ac* 0

@Giri: In your example, do you have a line of reasoning that explains the output being 0? I would say it should be 1 (but then my solution isn't AC'ed).

ohh... :hangs head in shame:

Thanks, Stephen.

@Giri ... it should be 1 ...

Judge data seems faulty or not conforming to the standards. I sent a checker and it got a runtime error. Admins please confirm

Ok, only the test-cases are more than 2 i think. Otherwise everything seems fine :)
Sorry :)

Yup, it doesn't say there will be exactly 2 test cases.

I agree with the earlier comments, the judge appears to be faulty here.

Checking.

Judge appears to have been fixed.

Can a wildcard pattern have length of 0 ?

A wildcard pattern cannot have length 0. The length is between 1 and 5

Admin,

I have solved three problems. I am unable to view my name in Indian rankings. Please check.My country is showing as 11.I would be happy to see my name in the rankings.

Yeah, we are looking into this. This should get solved tomorrow.

thanks a lot!

can any1 give me a worst case input?

i thought

vvvvvvvvvvvvvvvvvvvvvvvvv repeated 55000 times and v*v*v repeated 300 times would be the worst case

Nobody will give you hints, no.

I think vvvvvvvvvvvvvvvvvvvvvvvvv is 25 characters long

so it will take 55000X300X25 units of time at min.

for more than 2 test cases it will take more than 2 secs?

Isn't the time limit less than what shud be?

eg:

                     int a=55000,b=300,i,j,c;

                     for(int test=0;test<3;test++)
                     for(i=0;i<b;i++)
                      for(j=0;j<a;j++)

                      for(int y=0;y<25;y++)

                       c=a+b;

* can be replace by a sequence of characters as mentioned by the question. Can the sequence of characters be a null sequence also?

That is specifically mentioned in the problem statement.

Stephen can you clear my doubt?

I bet i only try to improve my programming skills , not cheat myself.

The time limit is 2 seconds.

@Praveen Submit code for any of the problems and this information should then be updated.

Ya done Admin. I am seeing it now.Thanks

There seems to be blank lines in the input that could, but should not, be treated as words of length zero. Have I got that right?

Are there empty lines in input that should be processed ?

It looks like there are empty lines that should NOT be processed. When I allowed for empty words (which the problem statement doesn't exclude) I got a wrong answer. Ignoring blank lines works.

Yup.. ignoring blank lines worked..

@ admin .. even my name doesn't show up in the rank list

I believe it is showing up now. It takes a bit of time for the rank list to be updated after submission of a solution.

I m getting Wrong answer again and again and I am sure its because I m using "gets()". 
scanf() is too slow.

Can someone pls suggest me what shall I do to speedily read a sentence from input???