Count the divisors of a number

Description:

Count the number of divisors of a positive integer n.

Random tests go up to n = 500000.

Examples (input --> output)

4 --> 3 (1, 2, 4)
5 --> 2 (1, 5)
12 --> 6 (1, 2, 3, 4, 6, 12)
30 --> 8 (1, 2, 3, 5, 6, 10, 15, 30)

 

Solution:

1. Repeat 'n' to generate numbers one after the other.
2. Check whether the generated numbers are divisible by 'n'.
3. Count the number of divisible numbers.

 

function getDivisorsCnt(n){
  let arr = []
  for (let i=1;i<=n;i++) {
    n%i==0 ? arr.push(i) : {}
  }
  return arr.length
}