Submission #2235019

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <map>
#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define REPI(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
using P = pair<long, long>;
using VI = vector<long>;

int d[1001];

void hoge(int n) {
    int i = 2;
    while (n != 1) {
        while (n % i == 0) {
            n /= i;
            d[i]++;
        }
        i++;
    }
}

int main() {
    long n;
    cin >> n;
    for (int i = n; i >= 2; i--) hoge(i);
    long ans = 1;
    REPI(i,2,n+1) {
        if (d[i]) {
            ans *= d[i] + 1;
            ans %= MOD;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result