洛谷 P1445 [Violet]樱花

 #include<cstdio>
 #include<algorithm>
 #include<cstring>
 #include<vector>
 using namespace std;
 #define fi first
 #define se second
 #define mp make_pair
 #define pb push_back
 typedef long long ll;
 typedef unsigned long long ull;
 typedef pair<int,int> pii;
 #define md 1000000007
 int num[];
 bool vis[];
 int d[];
 int n;
 ll ans=;
 int main()
 {
     ll i,j;
     scanf("%d",&n);
     //n=1000000;
     for(i=;i<=n;i++)    d[i]=i;
     for(i=;i<=n;i++)
         if(!vis[i])
             for(j=i;j<=n;j+=i)
             {
                 vis[j]=;
                 while(d[j]%i==)    d[j]/=i,num[i]++;
             }
     for(i=;i<=n;i++)    num[i]*=,ans=ans*(num[i]+)%md;
     printf("%lld",ans);
     return ;
 }