Submission #11459182

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
const long long MOD = 1e9 + 7;
typedef pair<int, int> P;

map<ll, ll> res;

void prime_factor(ll N)
{
    for (ll i = 2; i * i <= N; i++) {
        while(N % i == 0) {
            ++res[i];
            N /= i;
        }
    }
    if (N != 1) res[N]++;
}

int main()
{
    int N;
    cin >> N;

    ll ans = 1;
    repd(i, 1, N + 1) prime_factor(i);

    for (auto itr = res.begin(); itr != res.end(); itr++) {
        ans *= (itr->second + 1);
        ans %= MOD;
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result