Problem:
Score : 300 points

Problem Statement

You are given an integer N.
Find the number of the positive divisors of N!, modulo 10^9+7.

Constraints

1≤N≤10^3

Input

The input is given from Standard Input in the following format:

N

Output

Print the number of the positive divisors of N!, modulo 10^9+7.

Sample Input 1

3

Sample Output 1

4

There are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.

Sample Input 2

6

Sample Output 2

30

Sample Input 3

1000

Sample Output 3

972926972

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>

//bool isprime(int n);

int main(void){
  int n,i,j,k,i0,ans;
  int array[1001];

  scanf("%d",&n);
  for(i0=2;i0<n+1;i0++){
    i=i0;
    for(j=2;i!=1;j++){
      while(i%j==0){
        i/=j;
      //  printf("%d",j);
        array[j]++;
      }
    }
  }
  ans=1;
  for(i=0;i<n+1;i++){
    array[i]++;
    ans*=array[i];
    ans=ans%10000007;
    printf("%d\n",array[i]);
  }
  printf("%d\n",ans);
  return 0;
}