NDIV - n-divisors

We all know about prime numbers, prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

We can Classify the numbers by its number of divisors, as n-divisors-numbers, for example number 1 is 1-divisor number, number 4 is 3-divisors-number... etc.

Note: All prime numbers are 2-divisors numbers.

8 is a 4-divisors-number [1, 2, 4, 8].


Three integers a, b, n.


Print single line the number of n-divisors numbers between a and b inclusive.


1 7 2



1 <= a, b <=10^9
0 <= b - a <= 10^4
1 <= n <= 100

hide comments
amulyagaur: 2017-07-21 21:23:34

0.00 s with segmented sieve for divisors

sam128: 2017-07-10 21:05:22

use fast i/o for this problem..also sieving must be done till sqrt(10^9).

luvk1412: 2017-05-26 02:23:59

AC in 1 go, nice question, 0.00 sec :D

mastik5h_1998: 2017-03-21 17:20:25

strict time limit but AC...

scorpion_ajay: 2017-01-08 04:22:50

this is an easy one if you understand the concept of prime factorization and sieve :)

awesomeabhinav: 2017-01-01 18:02:32

I m getting TLE, I think my solution is efficient. PLEASE HELP
Solution id 18492490

harshgupta007: 2016-12-26 16:38:55

made a lot of mistakes trying a lot of different algorithms, finally got AC

karan_batra: 2016-08-28 15:31:07

Easy one. AC in one go :D.

insanshuman: 2016-08-09 20:56:22

ideone time limit:0.01s
but here time limit exceeded is shown

Ankur Singh: 2014-10-08 20:28:05

how is top solution made?
time: 0.01 sec!!!

Added by:abdelkarim
Time limit:0.221s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64