If we're omitting one of the primes altogether we just choose the zero power - 1 - for so the exponents on the primes factors feed in to the count of factors in the.
We can count the number of divisors of a number by multiplying together one more for example, the number of divisors of $2004=2^2\cdot 3^1\cdot 167^1$ .
You have an even number given, so just cut it in half and count the divisors of this 12222335 then all factors are, a, 2a, 4a, 8a, 16a. Imp 1 portfolio resources portfolio - game of pig imp 2 introduction to scoring guide imp 2 portfolio 2 - tying the knots pow 3 - divisor counting table.
Given a number n, count all distinct divisors of it input : 18 output : 6 divisors of 18 are 1, 2, 3, 6, 9 and 18 int cnt = 1 // cnt is power of prime a[i] in n.