Number of divisors

#1

getting WA in test cases but sample cases are passed
ide: https://ide.codingblocks.com/s/215288

#2

Hi @Vishal123

You are approaching this question wrongly. You are not supposed to modulo each input. Also you do not need to multiply all the numbers. Just calculate number of prime factors of all the numbers and answer can be expressed as follows : eg : 13 50 70 -> {13}, {2,5,5}, {2,5,7}. Now answer is just 1 added to product of number of all the prime numbers present. Which here is (13^(1))(2^(2))(5^(3))(7^(1)) , so answer is (1+1)(2+1)(3+1)(1+1) which is 48.
For proof please refer to internet or class 10 maths textbook :stuck_out_tongue:

Hopwe it Helps.