Submission #8001152

---

Source Code Expand

#include <iostream>
#include <map>
using namespace std;

long long const MOD = 1e9+7;

map<int, int> ans;

void f(int n) {
    for (int i = 2; i * i <= n; i++) {
        if (n % i != 0) continue;
        while (n % i == 0) {
            n /= i;
            ans[i]++;
        }
    }
    if (n != 1) ans[n]++;
}

int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) f(i);

    long long A = 1;
    for (int i = 1; i <= n; i++) {
        if (ans.count(i)) {
            (A *= (ans[i] + 1)) %= MOD;
        }
    }

    cout << A << endl;
    return 0;
}

Submission Info

Judge Result