Submission #2206454

---

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
const int mod = 1000000007;
int main(){
    int N,power,count;
    long long ans = 1;
    vector<int> plist;
    bool flag;
    cin >> N;
    for(int i=2;i<=N;i++){
        flag = true;
        for(int j=0;j<plist.size() && plist[j]*plist[j] <= i;j++){
            if(i%plist[j] == 0){
                flag = false;
                break;
            }
        }
        if(flag) plist.push_back(i);
    }
    for(int i=0;i<plist.size();i++){
        power = plist[i];
        count = 0;
        while(N >= power){
            count +=  N/power;
            power *= plist[i];
        }
        ans = ans*(count+1)%mod;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result