POJ - 3604 Professor Ben

题目：给出一个N，有若干的因子，求出因子的因子个数立方和

思路：令N=p1^a1*p2^a2*...*pn^an

那么答案为(1^3+2^3+...+a1^3)*(1^3+2^3+...+a2^3)*....

代码：

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<numeric>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define mm(a,b) memset(a,b,sizeof(a))
#define PP puts("*********************");
template<class T> T f_abs(T a){ return a > 0 ? a : -a; }
template<class T> T gcd(T a, T b){ return b ? gcd(b, a%b) : a; }
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
// 0x3f3f3f3f3f3f3f3f

const int maxn=1e5+50;
bool isprime[maxn];
int prime[maxn],tol;
void make_prime(int n){
    for(int i=0;i<=n;i++)
        isprime[i]=true;
    isprime[0]=isprime[1]=false;
    tol=0;
    for(int i=2;i<=n;i++){
        if(isprime[i])
            prime[tol++]=i;
        for(int j=0;j<tol;j++){
            if(i*prime[j]<=n)
                isprime[i*prime[j]]=false;
            else
                break;
            if(i%prime[j]==0)
                break;
        }
    }
}
LL solve(int n){
    LL a=n,b=n+1;
    if(a%2==0) a/=2;
    else b/=2;
    return a*a*b*b;
}
int main(){

    int T,n;
    make_prime(maxn-50);
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        LL ans=1;
        for(int i=0;i<tol&&prime[i]*prime[i]<=n;i++){
            if(n%prime[i]==0){
                int cnt=0;
                while(n%prime[i]==0){
                    cnt++;
                    n/=prime[i];
                }
                ans*=solve(cnt+1);
            }
        }
        if(n>1)
            ans*=solve(2);
        printf("%lld\n",ans);
    }
    return 0;
}