Please explain the test, I think there 're something wrong or I
don't understand the task.

I've read that problem twice, but i didn't undestand

Sample is Correct, You misunderstanding the prob,
we didn't add the number's together, we "bit or" the number

Notice that the Branches ID is 1, 2, 4, 8, 16 ~~ and so on
So if this cross road has a Number 5 it means 1001(in Binary), so it has 2 branches : type 1 and type 3

we must output the total sum of branch types, so
when we meet two cross road with 5 and 1,we must use
operation 'bit or' (in C, it's '|') to  calculate the total sum of branch types.
so you understand?


Edited by author 27.08.2008 20:51

The obscurity of the statement is outrageous!

For each point you need to increase distances until you find a distance, such that there are some non-zeros or you reach the distance of 5. Once you reach the distance you need to bitwise OR all the numbers at this distance.

Thanks, this is helping. but its very difficult to get this point of stopping at distance when one gets or of values greater than zero.