Submission #1520140

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <unordered_map>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using namespace std;
using LL = long long;

int Yakusu_count[100001];

int main() {
	int N;
	LL ans = 1;
	cin >> N;
	for (int i = 2; i <= N; i++) {
		int num = i;
		for (int j = 2; j < 1000; j++) {
			if (num % j == 0) {
				Yakusu_count[j]++;
				num /= j;
				j = 1;
			}
		}
	}
	for (int i = 0; i < 1000; i++) {
		ans = (ans*(Yakusu_count[i] + 1)) % MOD;
	}
	cout << ans << endl;
}

Submission Info

Judge Result