OJ Board

I thought that saying "two other words" meant "two different words".

Thank you. But I don't think that the problem statement is right because it says
that must be two different words. Anyway it was accepted.

I get WA every time I send the problem.

My algorithm:
For each word I look for every other word with the root equal to that word, then I get
the tail of that word and I search if that tail exists as a unique word and i check if it is
not the root to avoid false compound words made using the same ...

Please, could somebody post some conflictive inputs and outputs?
Thank you.

What should the output be if there is a underground passage in the north-west corner or in the south-east corner or in both?
I consider output "0" for these three cases.
Thank you.

I have tried to solve this problem but I am getting Runtime Error (SIGSEGV). And I have been watching the statistics and there are a lot of Runtime Error.
Which is the biggest number of rows and columns?
Any hint about Runtime Error?
Could the numbers in the table be separated by spaces or blank ...

I am going to update my linux C/C++ compiler.
Which is the gcc version that the judge uses actually?
Thank you.

I know that the plane must have land.
My program which checks every way of flying gives me for the first case:

120

but for the second one:

370

any hint?

Thank you Mido.
You have given good hints.

Thank you Mido.
You have given good hints.

I don't know where is your fault.
I just want to ask what is the algorithm used to solve this problem.
Could somebody explain to me?

Thanks.

As the problem statement says:

[quote]The second line will be a string of lowercase characters or blanks ending with three dots

The output for your input is:

asdma ... asdaskdj............
qwe.......qweqe .............

Good luck!

:( Wrong Answer again and again....

My code is:
[c]

#include<stdio.h>
#include<math.h>
#define TOL 0.0000001
main()
{
long double posible_t,radicando;
char encontrado;
long long r,t,p,q;
while(1)
{
scanf("%lld %lld",&p,&q);
if(p==0 && q==0)
break;
if(p==q)
{
encontrado=1;
r=2;
t=2;
goto ...

Thank you for your comment..
I was watching the status web page and I saw you sending the problem, and in 5 minutes I received the topic reply notification, first with 0 2 and then with 2 0.

I have just read the problem again and you are all right.
Thank you!!