Submission #2531868

---

Source Code Expand

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#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;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

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

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1000000007;

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	int n;
	cin >> n;

	VI prime;
	for (int i = 2; i < 500; i++) {
		bool p = true;
		for (int j = 2; j < int(sqrt(i)) + 1; j++) {
			if(i % j == 0) {
				p = false;
			}
		}
		if (p) {
			prime.push_back(i);
		}
	}

	map<int,int> mp;
	for (int i = 2; i < n + 1; i++) {
		bool p = true;
		for (auto&& j : prime) {
			for(int k = 1;; k++) {
				if(i % int(pow(j,k)) == 0) {
					mp[j]++;
					p = false;
				}
				else {
					break;
				}
			}
		}
		if (p) {
			mp[i]++;
		}
	}
  
	LL ans = 1;
	for (auto&& var : mp) {
		dump(var.first);
		dump(var.second);
		ans = ans * (var.second + 1);
		ans = ans % MOD; 
	}


	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result