Submission #2544411

---

Source Code Expand

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;
#define EPS (1e-7)
#define DEF (1e+9 + 7)

#define SORT(c) sort((c).begin(),(c).end())
#define ANS(ans) cout<<(ans)<<endl;
typedef vector<int> VI;


//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n)  for (int i = 0; i < (n); ++i)





int main() {
	int primenum[95] = { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499 };
	int n;
	cin >> n;
	if (n == 1) {
		cout << 1 << endl;
		return 0;
	}

	VI v(96);
	long long ans=1;
	
	REP(i, 96) {
		v[i] = 0;
	}
	
	FOR(i, 1, n) {
		int j = 0;
		int temp = i;
		while(true) {
			if (primenum[j] > i) break;
			if (temp%primenum[j] == 0) {
				v[j]++;
				temp /= primenum[j];
			}
			else {
				j++;
			}
			
		}
	}

	

	int i = 0;
	while (true) {
		if (v[i] == 0) {
			break;
		}
		ans *= (v[i] + 1);
		if (ans > DEF) {
			ans %= (int)DEF;
		}
		i++;
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result