i was thinking to multuply it the way in code and then create an array where there would be prime no and then divide the no created by multiply and then divide it ny prime no and keep on counting each time i divide.
is it the correct approach
Is it correct approach
which question are you talking about?
there is no such question as "number of divisors ".
send the link
so a prime factorisation of the numbers ,
let say prime p1,p2 occured q1,q2 times in all the numbers respectively then their contribution will be (q1+1)*(q2+1) to the answer.