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.
someone pls explain:
why it's necessary to compress the weights and then take 2^(x)%mod as done in editorial.
even without doing that, xor sum will be 0 for all even occurences.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Number Game on a Tree
You are viewing a single comment's thread. Return to all comments →
someone pls explain: why it's necessary to compress the weights and then take 2^(x)%mod as done in editorial. even without doing that, xor sum will be 0 for all even occurences.