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.
Example:
8 is a 4-divisors-number [1, 2, 4, 8].
Input
Three integers a, b, n.
Output
Print single line the number of n-divisors numbers between a and b inclusive.
Example
Input: 1 7 2 Output: 4
Constraints
1 <= a, b <=10^9
0 <= b - a <= 10^4
1 <= n <= 100
hide comments
P_Quantum:
2014-07-02 09:55:05
nice!! |
|
hossamyosef:
2014-04-25 01:37:51
I think the output should be the number of mistakes on the problem statement. :v :v
|
|
Priyanshu Srivastava:
2014-04-25 01:37:51
0.01 s....Top of the table.. :D Last edit: 2013-08-28 07:03:13 |
|
Sandeep Pathry:
2014-04-25 01:37:51
Ahhh!... finally gave a best solution... AC 0.02s...
|
|
Ivica Kièiæ:
2014-04-25 01:37:51
It's great that I've seen a - b <= 10^4 constraint in time... Never mind, AC is AC :D Last edit: 2013-05-24 18:30:26 |
|
rishabhshinghal:
2014-04-25 01:37:51
Finally got AC with 0.19 sec |
|
saket diwakar:
2014-04-25 01:37:51
AC...:) |
|
(Tjandra Satria Gunawan)(曾毅昆):
2014-04-25 01:37:51
@Pranshul Agarwal: wow.. 0.02s, I can't imagine that it's possible to reach that time for this problem in pyramid cluster.. Congratulations.. |
|
abdelkarim:
2014-04-25 01:37:51
@Pranshul Agarwal
|
|
Pranshul Agarwal:
2014-04-25 01:37:51
AC in 0.02 sec.. :D rank 1!!! :D |
Added by: | abdelkarim |
Date: | 2012-12-07 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Owner |