|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||256 MB||93||33||26||48.148%|
Your task in this problem is to determine the number of divisors of $n \choose k$. Just for fun -- or do you need any special reason for such a useful computation?
The input consists of several instances. Each instance consists of a single line containing two integers n and k (0 ≤ k ≤ n ≤ 431), separated by a single space.
For each instance, output a line containing exactly one integer -- the number of distinct divisors of $n \choose k$. For the input instances, this number does not exceed 263 - 1.
5 1 6 3 10 4
2 6 16