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>

int main(void)
{
  int N;
  int A[1001] = {0};
  int i, j;
  int tmp;
  long long int value = 1;
  scanf("%d", &N);

  for(i = N; i > 1; i--) {
    tmp = i;
    for(j = 2; j < tmp+1; j++) {
      if(tmp == 1) {
	break;
      } else {
	while(tmp%j == 0) {
	  tmp /= j;
	  A[j]++;
	}
      }
    }
  }
  for(i = 0; i < 1001; i++) {
    value *= (A[i]+1);
  }

  printf("%lld\n", value%1000000007);
  return 0;
}