Sir where i did wrong in this code?
as mention in the question
Since n can be as large as having 50 digits
you can’t multiply and then find no of divisors
correct approach is discuss in the video named “noofdivisor hint”
My Code
ohh that means we have to count each array elements saperately
Yes we have to count all prime factor of each number and add them
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.