OJ Board

Am I misinterpreting the problem? Can someone post
some sample please?

By the way, how is 0 0 handled? Should we print out "YES 0" like it said in the sample?

You program has to check for a number of cases:
1. Whether the pattern of *'s is different for all words in the set and:
2. Compute the number of words obtained by replacing the *'s by 0's and 1's.

i cant' get what is the meaning of point 1. what is the meaning of pattern of *'s is different for all words in the set.
and how's about in sample input output, is in the last line of our output we must write "YES 0" ?

thanks.
-titid gede-

1.
Whether the pattern of *'s is different for all words in the set and:
2.
Compute the number of words obtained by replacing the *'s by 0's and 1's.

Can someone explain part 1?

0 0 results in a "YES 0".

Part 1: Read in the strings. Replace all the 1's with 0's. If there are any duplicate strings, print "NO".

Input:
3 3
10*
*0*
*00
4 3
1100
1101
110*
3 3
10*
*0*
*00
5 4
00010
1111*
***10
11*10
4 3
1100
1101
110*
2 4
1*
*1
**
11
1 3
0
1
*
0 0

Ouput:
YES 4
NO
YES 4
YES 9
NO
YES 4
NO
YES 0

Thanks for explaining part 1, I got AC with minor changes..

The words will not be longer than 15 symbols.

There is no telling about number of words on input does that mean it may be all combinations of 15 symbol word for a total of 32767 words on imput?

Hello, Users!!
I'm from Russia and my english isn't good. +)
Now is a time to make some homeworks in University. In my university there are the tasks from this website. I must make programm, but a have a lot of problems with my task. Please help me. Can you send me sourses or ideas of sourses please? I will be very happy, if you could help me.
Thanks +)

That will not get you anywhere...

What you do is - try to come up with the solution yourself. Then if you can't, you post what you got so far. Then, maybe, you get a hint or two. repeat the process until you get the solution.

After you know what to do, try to implement it (code it). Again, if you get stuck (but really stuck), post what you have so far and what's not working. And then you might get some help.

Sending a coded solution to someone is not helping. I know, everyone says it, but you'll understand it when the final exam comes

Darko

[insulting message deleted by moderator]

I am pretty much a begginer, if you go to the link in my signiture below they numbers are to the easy problems.

I get "YES 8" for my WA program.
I am doing all possible replacements of * by 0 and 1 to the word, and check whether the new string has appeared before. Then Output how many new string were found.

Can you explain why this input set will give an output "YES 9"?

Input

5 4
00010
1111*
***10
11*10

Output

YES 9

The 9 strings are..
Hope it helps.

At first, I was warried about the test cases may be large, but after submitted the code and got AC, I realized the number of test cases is small.