Divisors of the Divisors of an Integer

http://codeforces.com/gym/102040 

思路：这种题一般素因子分解看看行不行的了。。n!==p1^a1*p2^a2....假设为3^a1*5^a2;那么因为素因子的d(x)=2；而3^a1表示因子可以为：3^0,3^1,3^2.....共a+1个；而发现这些的d(3^i)=i+1;就是1~a+1;那么求和就是(a+1)(a+2)/2;也可以理解成每次多了个3因子,就是每次多了1；以此类推即可；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e6+9;
const int maxm=4e5+9;
const int mod=1e7+7;

ll a[maxn],pre[maxn];
int cnt=0;
bool vis[maxn];
void P()
{
    for(int i=2;i<maxn;i++)
    {
        if(!vis[i])
        {
            pre[cnt++]=i;
            for(int j=i+i;j<maxn;j+=i) vis[j]=1;
        }
    }
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    P();

    int n;
    while(cin>>n&&n)
    {
        for(int i=0;pre[i]<=n;i++)
        {
            a[i]=0;
            int tmp=n;
            while(tmp)
            {
                a[i]+=tmp/pre[i];
                tmp/=pre[i];
            }
        }

        ll ans=1;
        for(int i=0;pre[i]<=n;i++)
        {
            ans=(((a[i]+1)*(a[i]+2)/2) %mod)*ans%mod;
        }
        cout<<ans<<endl;
    }


    return 0;
}