Submission #3813657

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)

#define endl "\n"
#define pb push_back
#define elif else if
#define cout_db cout << fixed

#define MOD 1000000007
 
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
const int dx_8[]={1,1,0,-1,-1,-1,0,1}, dy_8[]={0,-1,-1,-1,0,1,1,1};

typedef long long ll;

template <typename T>
inline T GCD(T a,T b){T c;while(b!=0){c=a%b;a=b;b=c;}return a;}
template <typename T>
inline T LCM(T a,T b){T c=GCD(a,b);a/=c;return a*b;}
template <typename T>
inline T nCr(T a,T b){T i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
template <typename T>
inline T nHr(T a,T b){return nCr(a+b-1,b);}
template <typename T>
inline T POW(T a,T b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}

int n;
const int N = 1010;

vector<bool> chpri(N);
vector<int> prime;

void eratosthenes(){
    for (int i = 0; i < N; i++) chpri[i] = 1;
    chpri[0] = chpri[1] = 0;
    for (int i = 2; i <= sqrt(N); i++) {
        if(chpri[i]){
            for (int j = 2*i; j <= N; j+=i) {
                chpri[j] = 0;
            }
        }
    }
    for (int i = 1; i < N; i++) {
    	if(chpri[i]) prime.push_back(i);
    }
}

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

	eratosthenes();
	
	cin >> n;
	ll ans = 1;
	for (int i = 0; i < prime.size(); i++) {
		if(prime[i] > n) break;
		int num = n, cnt = 1;
		while(num / prime[i] != 0){
			num /= prime[i];
			cnt += num;
		}
		// cout << prime[i] << ": " << cnt << endl;
		ans *= (ll)cnt;
		ans %= (ll)MOD;
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result