Submission #3426343

---

Source Code Expand

#include <iostream>
#include <map>

using namespace std;
typedef long long ll;
const ll MOD = 1000000007;

int ff(int n) {
    map<int, int> factors;
    for(int t=2; t<=n; t++) {
        int x = t;
        int p = 2;
        while(x>=p*p) {
            if(x%p==0) {
                x /= p;
                factors[p] += 1;
            } else {
                p += (p==2) ? 1 : 2;
            }
        }
        if(x>1) factors[x] += 1;
    }
    ll res = 1;
    for(auto &a : factors) {
        res = (res * (a.second+1)) % MOD;
    }
    return res;
}

int main() {
    int n;
    cin >> n;
    cout << ff(n) << endl;

    return 0;
}

Submission Info

Judge Result