OJ Board

still desperated...

So you get accepted... my output is now:

5 4 8 11 13 4 7 2 1
not complete
not complete
not complete
not complete
22 33 44
not complete
not complete
4 6 8 11 7
5 4 8 11 13 4 7 2 1
not complete
not complete
not complete
5 6
3
not complete
not complete
not complete
not complete
2 3 6 4
4294967295
not ...

Hello, i've been doing this problem for a good amount of hours and the judge doesn't want to accept it : S.


The input file checks all the different cases i think:
- All sons are L
- All sons are R
- All sons are repeated (500 repeated nodes)
- Tree without root.
- Disconected trees.
- And not ...