Submission #1591975

---

Source Code Expand

#include<bits/stdc++.h>

#define MOD ((int)(1e9+7))

using namespace std;

typedef long long int Int;

Int pnum[1000];

bool IsPrime(Int n)
{
    Int num = sqrt(1.0*n);
    if(n == 2)
    {
	return true;
    }

    for(int i = 2;i <= num;i += 2)
    {
	if(n % i == 0)
	    return false;
    }

    return true;
}

Int Solve(Int n)
{
    Int count = 1;

    for(int i = 0;i < 1000;i++)
	pnum[i] = 1;

    for(int i = 2;i <= n;i++)
    {
	Int temp = i;
	for(int j = 2;j <= temp;) {
	    if(temp % j == 0 && IsPrime(j))
	    {
		pnum[j]++;
		temp /= j;
	    } else {
		j++;
	    }
	}
    }

    for(int i = 0;i < 1000;i++)
    {
	count = (count*pnum[i])%MOD;
    }

    return count;
}

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

    cout<<Solve(n)<<endl;

    return 0;
}

Submission Info

Judge Result