Submission #2215093

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<bitset>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X) cout<< #X <<": "<<X<<" ";
#define ARDEB(i,X) cout<< #X <<"["<<i<<"]: "<<X[i]<<" ";
#define END cout<<endl;
#else
#define DEB(X) {}
#define ARDEB(i,X) {}
#define END {}
#endif
typedef long long int ll;
typedef pair<int,int> P;
struct edge{int to,cost;};
#define REP(i,n) for(int i=0;i<(n);i++)
const int INF=100000000;

vector<ll> PF;
ll num[100010];

void DecompositPrime(int n){
	int a=2;
	while(n>=a*a){
		if(n%a==0){
			num[a]++;
			n/=a;
		}
		else{
			a++;
		}
	}
	num[n]++;
}

int main(){
	ll n,ans=1;
	cin>>n;
	for(int i=0;i<=10000;i++){
		num[i]=1;
	}
	for(int i=1;i<=n;i++){
		DecompositPrime(i);
	}
	for(int i=2;i<=10000;i++){
		ans=ans*num[i]%1000000007;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result