OJ Board

You must to test all input possibilities like "num1 == num2", the input order must be the same of output "10 1" ...

Iv@n
Brasil

I did that (at least I think so :( ) and stiil, WA!
My code is attached.
Please help ...

I tried putting in a lop, so that it reads all the input. It now works with the test input. However, now I get Time Limit exceeded. If I take out the loop and process each tree at a time, I get WA.

The code with the loop is given below ...

Over here the program does not work, and I cannot understand how you have tested it with success.
In your main routine you have no loops at all. How should the program be able to test more than one three - and hence correctly run the test example which have two trees?

I assumed that the program ...

In my opinion the whole confusion is because you are assuming that there can be other blocks in a position while the original block itself is not there.
For example blocks 7 and 8 can be in the position of block 3 while block 3 is at that instant in another position, say in the position of block 2 ...

Hi,
I submitted the following program for Problem 122. However I get WA. The program works for the sample input as well as other inputs I devised.
Please help.
------------------------------------------------------------------------------
#include <stdio.h>
#include <stdlib.h>

typedef struct node ...