B - Factors of Factorial AtCoder - 2286

最新推荐文章于 2019-05-29 18:32:32 发布

gtuif

最新推荐文章于 2019-05-29 18:32:32 发布

阅读量185

点赞数

分类专栏：素数数论

本文链接：https://blog.csdn.net/gtuif/article/details/79714816

版权

数论同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

素数

5 篇文章 0 订阅

订阅专栏

You are given an integer N. Find the number of the positive divisors of N!, modulo 10⁹+7.

Constraints

1≤N≤10³

Input

The input is given from Standard Input in the following format:

Output

Print the number of the positive divisors of N!, modulo 10⁹+7.

Sample Input 1

Sample Output 1

There are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.

题意：求n的阶乘的因子数；

思路：数论的原理，n的阶乘的因子个数等于n的素因子个数的幂的乘积；

下面附上我的代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int k[1005]; 
const LL mod=1e9+7;
int main()
{
	int n;
	cin>>n;
	for(int i=2;i<=n;i++)
	{
		int l=i;
		for(int j=2;j<=l;j++)
		{
			while(l%j==0)
			{
				k[j]++;
				l/=j;
			}	
		}
		if(l) k[l]++;
	}
	LL sum=1;
	for(int i=2;i<=n;i++)
	{
		if(k[i])
		{
			sum*=(k[i]+1);
			sum=sum%mod;
		}
	}					
	printf("%lld\n",sum%mod);
	return 0;
}