C(n,k) 的质因子分解 POJ - 2992

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?

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.

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.

Sample Input

5 1
6 3
10 4

Sample Output

2
6
16

比赛的时候一直TLE，赛后发现数据太多需要打表……

打了个表很轻松就过了。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

bool g[500];
int m[500], y[500], a[500][500];      //a