Divisors
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6785 | Accepted: 1781 |
Description
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
n!的素因子i的个数 = (n-1)!的素因子i的个数 + n的素因子i的个数
c(n,k)的素因子i的个数 = n!的素因子i的个数- (n-k)!的素因子i的个数 - k!的素因子i的个数
#include<iostream>
#include<cstdio>
using namespace std;
int is[500],prime[500],pl;
void _prime()
{
for(int i=2;i<500;i++)
{
if(is[i]==0) prime[pl++]=i;
for(int j=0;j<pl&&i*prime[j]<500;j++)
{
is[i*prime[j]]=1;
if(i%prime[j]==0) break;
}
}
}
__int64 _count(int n,int p)
{
__int64 cnt=0;
while(n)
{
cnt+=n/p;
n/=p;
}
return cnt;
}
int main()
{
_prime();
int n,k;
while(scanf("%d%d",&n,&k)==2)
{
__int64 cnt=1;
for(int i=0;prime[i]<=n;i++)
{
cnt*=(1+_count(n,prime[i])-_count(k,prime[i])-_count(n-k,prime[i]));
}
printf("%I64d/n",cnt);
}
return 0;
}