Poj 2992 Divisors（算数基本定理&素数因子个数）

我们首先来看一下题面：

Your task in this problem is to determine the number of divisors of Cnk. Just for fun -- or do you need any special reason for such a useful computation?

translation:在这个问题中，你的任务是确定的因子个数。说着玩的——或者你需要我对这种益处多多的计算给出任何特别的理由吗？

Input

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.

translation：输入包含多个实例（多组输入警告）。每个实例包含一行，包含两个正数n和k，用空格分隔。

Output

For each instance, output a line containing exactly one integer -- the number of distinct divisors of Cnk. For the input instances, this number does not exceed 2 63 - 1.

translation：对于每个测试实例，输出仅包含一个整数的一行——