Submission #3000353

---

Source Code Expand

#include <bits/stdc++.h>
#define debug(args...) fprintf(stderr, args)
using namespace std;

const int MOD = 1e9 + 7;

typedef long long lint;

int main() {
    int n;
    vector<int> ps;
    cin >> n;
    for (int i = 2; i <= n; i++) {
        bool prime = true;
        for (int j = 2; prime && j * j <= i; j++) {
            if (!(i % j)) prime = false;
        }
        if (prime) ps.push_back(i);
    }
    lint ans = 1;
    for (int p : ps) {
        lint cnt = 0;
        for (int i = 2; i <= n; i++) {
            int j = i;
            while (!(j % p)) {
                cnt++;
                j /= p;
            }
        }
        ans = (ans * (1 + cnt)) % MOD;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result