Submission #1534671

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<functional>
#include<queue>
#include<stack>
#include<math.h>
#define INF (1 << 30) - 1 + (1 << 30)
#define EPS 1.0e-6

using namespace std;

typedef pair<int, int> P;
int n;
vector<P> primefactor;

int main()
{
	cin >> n;
	primefactor.push_back(P(2,1));
	for (int i = 3; i <= n; i++) {
		int ope = 1;
		int k = i;
		for (int j = 0; j < primefactor.size();j++) {
			//if (primefactor[j].first * primefactor[j].first > k)break;
			
			while (k % primefactor[j].first == 0) {
				ope = 0;
				primefactor[j].second++;
				k /= primefactor[j].first;

			}
		}
		if (ope == 1) {
			primefactor.push_back(P(i, 1));
		}
	}
	long long ans=1;
	for (int i = 0; i < primefactor.size(); i++) {
		ans *= primefactor[i].second + 1;
		ans %= 1000000007;
	}
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result