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.
"Lets apply compression and reduce the range of numbers present in the tree from to and replace each new number with . mod should be chosen such way that avoids colloision. I preferred to use 2 different modulos together."
Can someone please explain what is happening in this statment?
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.
"Lets apply compression and reduce the range of numbers present in the tree from to and replace each new number with . mod should be chosen such way that avoids colloision. I preferred to use 2 different modulos together."
Can someone please explain what is happening in this statment?
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.
can anyone explain How to calculate the number of paths with even count of occurences for all numbers present on it
My score isn't getting added to leaderboards