Submission #2212853

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main(void) {
    int n;
    long long ans = 1;
    vector<int> prime;
    cin >> n;
    for (int i = 2; i <= n; i++) {
        bool flag = true;
        for (int j = 2; j * j <= i; j++) {
            if (i != j && !(i % j)) {
                flag = false;
                break;
            } 
        }
        if (flag)
            prime.push_back(i);
    }
    cin >> n;
    for (auto item : prime) {
        int zohe = 0;
        for (int i = 2; i <= n; i++) {
            int ehoz = i;
            while (!(ehoz % item)) {
                zohe++;
                ehoz /= item;
            }
        }
        ans = ans * (zohe + 1) % 1000000007;
    }
    cout << ans << endl;
}

Submission Info

Judge Result