Atcoder beginner contest 114D 756

https://atcoder.jp/contests/abc114/tasks/abc114_d
题意：求n！的因数中有多少个恰好有75个因数。
思路：首先先找出一种方法能由a,b的一些与因数有关的信息推出a×b的信息。比如a分解质因数后a=p1^x1+p2^x2+…pn^xn,那么a的因数个数就有(x1+1)×(x2+1)×(x3+1)…×(xn+1)个。75=5×5×3=25×3=15×5=75。那么先把1-n全部分解质因数，统计每个质数出现的个数(如4中2出现2个)。统计出x+1>=3,5,15,25,75,设他们为x3,x5,x15,x25,x75排列组合就发现ans=(x3-2)×x5×(x5-1)/2+(x3-1)×x25+x15×(x5-1)+x75

#include<cstdio>
#include<string>
#include<cstring>
#include<utility>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<algorithm>
#include<vector>
#include<iostream>
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7fffffff
using namespace std;
int a[30];//75=25*3=5*15=5*5*3
int p[30]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
int main()
{
	int i,j,k,n,m,x,y;
	scanf("%d",&n);
	for(i=2;i<=n;i++)
	{
		x=i;
		for(j=0;p[j]<=x&&j<25;j++)
		{
			while(x%p[j]==0)
			{
				a[j]++;
				x/=p[j];
			}
		}
	}
	int x3=0,x5=0,x15=0,x25=0,x75=0;
	for(i=0;i<25;i++)
	{
		if(a[i]>=2)
		{
			x3++;
		}
		if(a[i]>=4)
		{
			x5++;
		}
		if(a[i]>=14)
		{
			x15++;
		}
		if(a[i]>=24)
		{
			x25++;
		}
		if(a[i]>=74)
		{
			x75++;
		}
	}
	printf("%d",(x3-2)*x5*(x5-1)/2+(x3-1)*x25+x15*(x5-1)+x75);
}