Tree Problem, is it solvable?

Правка en1, от SleepingThread, 2022-05-05 04:15:10

Hello everyone! I was solving a problem, but thinking in the wrong way, but I came up with this problem :

Given a 0-1 weighted tree that contains $$$N$$$ nodes $$$N <= 10^5$$$.

The value of a path is the sum of weights on this path.

For each node, find the number of simple paths which passes this node and have an odd value.

Have a good day!

Теги trees, problem, question

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский SleepingThread 2022-05-05 04:15:10 381 Initial revision (published)