Submission #1243888

---

Source Code Expand

#include <bits/stdc++.h>
#define MOD 1000000007
#define SIZE 1005
 
using namespace std;
typedef long long ll;
int N;
int X[SIZE];

int main(){

cin>>N;

for(int j=2; j<=N; j++){
    int k=j;
for(int i=2; i<=j; i++){
    if(k%i==0){
        int cnt=0;
        while(k%i==0){
            k/=i;
            cnt++;
        }
        X[i]+=cnt;
    }
 }
}

ll ans=1LL;
for(int i=2; i<=N; i++){
    if(X[i]>0){
        ans=ans*(X[i]+1LL)%MOD;
    }
}

cout<<ans<<endl;

return 0;
 
}

Submission Info

Judge Result