Submission #1987104

---

Source Code Expand

#include <iostream>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main(void) {
  bool notprime[1001] = {};
  vector<int> primes;
  for (int i = 2; i <= 1000; i++) {
    if (!notprime[i]) {
      for (int j = i; j <= 1000; j += i) notprime[j] = 1;
      primes.push_back(i);
    }
  }
  int n;
  cin >> n;
  vector<int> cnt(primes.size(), 0);
  for (int i = 2; i <= n; i++) {
    int tmp = i;
    for (int j = 0; j < primes.size(); j++) {
      while (tmp % primes[j] == 0) {
        cnt[j]++;
        tmp /= primes[j];
      }
    }
  }
  ll ans = 1LL;
  for (int i = 0; i < primes.size(); i++) {
    ans = ans * (cnt[i] + 1) % MOD;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result