Submission #3000335

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <unistd.h>
#include <utility>
#include <vector>
#define int ll
#define dbc(x) //cerr << x << '\n'
#define dbn(x) //cerr << #x << " == " << x << '\n'
#define pb push_back
#define endl '\n'

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

//
const int MOD = 1e9 + 7;
map<int, int> him;
map<int, int> glob;

bool sieve[10000];

void sie(int n) {
	memset(sieve, 1, sizeof sieve);
	sieve[0] = sieve[1] = 0;
	for (int i=2; i*i <= n; i++) {
		if (sieve[i]) {
			for (int j=i*i; j<n; j+=i) {
				sieve[j] = false;
			}
		}
	}
}

void fac(int m) {
	him.clear();

	for (int i=2; i <= m; i++) {
		while (m % i == 0) {
			him[i]++;
			m /= i;
		}
	}

	for (auto i : him) {
		dbn(i.first);
		dbn(i.second);
		glob[i.first] += i.second;
	}
	dbc("====");
}

main(){
	ios::sync_with_stdio(false), cin.tie(0);

	int n; cin >> n;
	sie(n);

	for (int i=2; i<=n; i++) {
		fac(i);
	}

	int resp = 1;
	for (auto i : glob) {
		resp = (resp * (i.second + 1)) % MOD;
	}

	cout << resp << endl;
}

Submission Info

Judge Result