Submission #3011497

---

Source Code Expand

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <map>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;

bool is_prime(ll n){
  for(ll i = 2; i * i<=n; i++){
    if(n%i==0) return false;
  }
  return n!=1;
}

int main(){
  ll n;
  cin >> n;
  map<ll,ll> res;
  for(ll j = 1; j<= n; j++){
    ll s = j;
    for(ll i = 2; i*i <= n; i++){
      while(s%i==0){
        ++res[i];
        s/=i;
      }
    }
    if(s!=1) res[s]++;
  }
  ll ans = 1;
  for(ll j = 1; j <= n; j++){
    ans = ans * (res[j]+1) % 1000000007;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result