Factorial Divisor-Unique Decomposition Theorem

Idea: directly use the unique decomposition theorem to be solvable.

The only decomposition theorem : portal (click me)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200],ans=1,n;

int main()
{
    
    
    for(int i=2;i<=100;i++){
    
    
        n=i;
        for(int j=2;j<=n;j++){
    
    while(n%j==0)a[j]++,n/=j;}
    }
    for(int i=2;i<=100;i++)if(a[i])ans*=(a[i]+1);
	return cout<<ans<<endl,0;
}

Output answer: 39001250856960000