Submission #1242019

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<math.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
const long double pi = 3.14159265358979323846264338327950288;
bool a[1001];
int b[1001];
int main() {
	fill(a, a + 1001, true);
	a[0] = false, a[1] = false;
	for (int i = 0; i < 1001; i++) {
		if (a[i]) {
			int j = i * 2;
			while (j < 1001) {
				a[j] = false;
				j += i;
			}
		}
	}
	int n;
	cin >> n;
	for (int i = 0; i <= n; i++) {
		int c = i;
		for (int j = 0; j <= i; j++) {
			if (!a[j]) continue;
			while (c%j == 0) {
				c /= j;
				b[j]++;
			}
		}
	}
	ll sum = 1;
	for (int i = 0; i <= n; i++) {
		if (a[i]) {
			sum *= (b[i]+1);
			sum %= 1000000007;
		}
	}
	cout << sum << endl;
	cin >> n;
}

Submission Info

Judge Result