Heights of the Trees

The list of heights is a subset of the $D$ values in the given lists. The solution is given below:

• Sort the given divisors list in strictly decreasing order of D values.

• Iterate over the pairs from the beginning of the sorted list. For each $D_{i}$decrease the value of $F_{j}$ by $F_{i}$where $D_{i} \equiv 0 \mod D_{j}$ and $D_{i} \neq D_{j}$

• After that print the pairs where $F_{i} > 0$ in strictly increasing order of $D_{i}$