Asking for help to solve a Data Structure related tree problem
Difference between en2 and en3, changed 78 character(s)
Recently I have come across a problem of an IUPC contest, where the problem asks for the summation of the mex value of all subtrees of a tree for each vertex where the vertex is the root of the tree. The detailed statement is given below or can be found in [I-Mexy](https://toph.co/c/cuet-inter-university-codestorm-1-0).↵
↵
[Statement](/predownloaded/0f/1f/0f1f5c0caa992d75d4524d14c25aeac23292e2b4.png)↵
Can anyone give me hints or provide any resources about this topic? 

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English babjamal 2024-12-28 11:50:54 2 Tiny change: '2b4.png)\nCan anyo' -> '2b4.png)\n\nCan anyo'
en3 English babjamal 2024-12-28 11:50:13 78
en2 English babjamal 2024-12-28 11:48:54 35
en1 English babjamal 2024-12-28 11:47:49 484 Initial revision (published)