Exceeding time limit

#1

Please check the code id

#2

actually you are using brute force here, you should use the approach of factroising the numer and then finding the divisors.
If x=am∗bn∗cp…
where a, b, c, … are the prime factors of x, then the number of factors of x is
(m+1)(n+1)(p+1)…

This is because any factor can be made by selecting 0 to m numbers of a (in m+1 ways), 0 to n numbers of b (in n+1 ways) and so on.

Since 600=23∗3∗52
Total number of factors of 600 = (3+1)(1+1)(2+1) = 24

#3

this is my code https://ide.codingblocks.com/s/116305

#4

there is more to the questions here, you have to first count which count is occuring how many times , in all the numbers , then apply it there

#5
#6

please explain the question i am unable to do it and sample code ide is also blank