ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1088. Ilya Murometz

Dinh Hong Minh Can u explain me this problem , DQH ( DSAP Group ) ? [5] // Problem 1088. Ilya Murometz 13 Mar 2001 21:07
Dinh Quang Hiep (mg9h@yahoo.com) hmmmm, u are so lazy X-( [4] // Problem 1088. Ilya Murometz 13 Mar 2001 21:14
it's a full binary tree, with the deep = F
Ilya is on the deep of D
The magic stone is in the deep of E
every leaves is numbered from the left, the fist number is
1.
do u understand what i've said :">????

QH@
Dinh Hong Minh What does this problem want ? [2] // Problem 1088. Ilya Murometz 13 Mar 2001 21:51
> it's a full binary tree, with the deep = F
> Ilya is on the deep of D
> The magic stone is in the deep of E
> every leaves is numbered from the left, the fist number
is
> 1.
> do u understand what i've said :">????
>
> QH@
>
Dinh Quang Hiep (mg9h@yahoo.com) Re: What does this problem want ? // Problem 1088. Ilya Murometz 13 Mar 2001 21:53
u must count the length from Ilya to the magic stone, and if
 this length <= H, u write YES, otherwise, u write NO !!!!
Dinh Hong Minh Thanks // Problem 1088. Ilya Murometz 13 Mar 2001 21:55
> > it's a full binary tree, with the deep = F
> > Ilya is on the deep of D
> > The magic stone is in the deep of E
> > every leaves is numbered from the left, the fist number
> is
> > 1.
> > do u understand what i've said :">????
> >
> > QH@
> >