Kindly suggest dynamic programming approach for this ques....

image

suppose we are getting product 9, then its divisor are 1, 3, 9. Hence there are odd number of divisors so we will consider the path...

Comments (0)