Number Game on a Tree

Sort by

recency

|

4 Discussions

|

  • + 0 comments

    "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?

  • + 2 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.

  • + 0 comments

    can anyone explain How to calculate the number of paths with even count of occurences for all numbers present on it

  • + 1 comment

    My score isn't getting added to leaderboards

No more comments