We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Could someone please explain the formula used to solve this problem? Is it a well known problem in academia? How did everyone know the exact method of solving this?
Mum I would like to implement the first solution for N < 10 (building the whole tree). But actualy I have no idea how to build this tree step by step (which node to use to connect to the next tree?). Could you help me please? I am stuck. Thanks a lot!
in sample input 0, if A0 were 2 instead of 1, would d(3,4) (keeping same numbering as in example) have been 2 instead of 1 as well? Since the distance of the - (horizontal) part of the H doesn't have a number on it, and one might think it's 1 all the time.
No more comments
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Shitty editorial.Its better to not provide one instead
Could someone please explain the formula used to solve this problem? Is it a well known problem in academia? How did everyone know the exact method of solving this?
Mum I would like to implement the first solution for N < 10 (building the whole tree). But actualy I have no idea how to build this tree step by step (which node to use to connect to the next tree?). Could you help me please? I am stuck. Thanks a lot!
I am not getting the formula.What is X and how it is calculated
in sample input 0, if
A0were 2 instead of 1, wouldd(3,4)(keeping same numbering as in example) have been 2 instead of 1 as well? Since the distance of the-(horizontal) part of theHdoesn't have a number on it, and one might think it's 1 all the time.