Submission #1588661

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll mod=1000000007;

bool prime[1001];

int main(){
        for(int i=0;i<1001;i++){
                prime[i]=true;
        }
        for(int i=2;i<1001;i++){
                if(prime[i]==true){
                        for(int j=i+i;j<1001;j+=i){
                                prime[j]=false;
                        }
                }
        }
        ll N;
        cin>>N;
        ll res=1;
        vector <ll> v;
        for(int i=2;i<1001;i++){
                int cnt=0;
                if(prime[i]){
                        for(int j=2;j<=N;j++){
                                int m=j;
                                while(m%i==0){
                                        m/=i;
                                        cnt++;
                                }
                        }
                }
                res*=(cnt+1);
                res%=mod;
        }
        cout<<res<<endl;
        return 0;
}

Submission Info

Judge Result