来啦

哈哈哈
来复制
复制完自己想想
开心就好

#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
bool vis[1111];
vector<int> p;
int main(){
    int n;
    cin>>n;
    memset(vis,1,sizeof vis);
    if (n<2){
        cout<<1<<endl;
        return 0;
    }
    vis[0]=vis[1]=0;
    for (int i=2;i<=n;++i) {
        if (vis[i]) {
            p.push_back(i);
            for (int j=i*i;j<=n;j+=i) {
                vis[j]=0;
            }
        }
    }
    long long ans=1;
    for (int ps:p) {
        int et=0;
        int pr=ps;
        while (pr<=n) {
            et+=n/pr;
            if (pr>n/ps){
				break;
			}
            pr*=ps;
        }
        ans=(ans*(et+1))%MOD;
    }
    cout<<ans<<endl;
    return 0;
}