Find the number of ways of splitting the tree such that every tree thus formed has a given xor value. Number of ways to remove zero or more edges from this tree in such a way that each individual tree thus formed by removing these edges has XOR value x The tree's node are marked with a number in it. The xor value of a tree is the xor value of all its nodes.


closed as off-topic by Pedro Tamaroff Feb 7 at 14:01

  • This question does not appear to be about math within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ What tree? Do you need to supply a diagram perhaps? And what have you tried already? Questions without context or visible effort tend to be downvoted and closed. $\endgroup$ – postmortes Feb 5 at 19:18
  • $\begingroup$ A a tree with N nodes and N-1 edges. $\endgroup$ – Want_to_learn Feb 5 at 19:28
  • $\begingroup$ Is this a coding challenge? $\endgroup$ – Mike Earnest Feb 5 at 20:06
  • $\begingroup$ No just a simplex question $\endgroup$ – Want_to_learn Feb 6 at 9:23
  • $\begingroup$ Ongoing contest question. Will reopen once contest concludes. $\endgroup$ – Pedro Tamaroff Feb 7 at 14:01

This is a problem from an ongoing coding contest on codechef. Please do not answer this. Here is the link for the problem from the ongoing contest.


This site is temporarily in read only mode and not accepting new answers.

Not the answer you're looking for? Browse other questions tagged .