![](https://i-blog.csdnimg.cn/blog_migrate/2bcd579a7affbd49c932ac4a4e12539d.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0bc46d9763d0571f096e53710c7078f8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/69ff0c41fc368ec791083a6dcad017d3.png)
![](https://i-blog.csdnimg.cn/blog_migrate/0d8e80c303965429e5b09270cce43c48.png)
#include<iostream>
using namespace std;
const int N=110;
int prime[N],a[N],cnt;
bool vis[N];
void get_prime(int n)
{
for(int i=2;i<=n;i++)
{
if(vis[i]==0)
{
prime[cnt]=i;
cnt++;
}
for(int j=2*i;j<=n;j+=i)
{
vis[j]=1;
}
}
}
int main()
{
get_prime(100);
for(int i=0;i<cnt;i++)
{
int p=prime[i],n=100;
while(n)
{
a[i]+=n/p;
n/=p;
}
}
long long ans=1;
for(int i=0;i<cnt;i++)
{
ans*=(a[i]+1);
}
cout<<ans<<endl;
return 0;
}
okk