http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=2374
此题结果不必取模
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 10000000;
const int MOD = 1000000007;
int prime[664580],tot;
bool nop[N+1];
int T,k;
ll ans,n;
ll fun(ll a,ll k) {
ll s=1;
while (k) {
if (k&1) s=s*a%MOD;
a=a*a%MOD;
k>>=1;
}
return s;
}
int main( ) {
for (int i=2;i<=N;++i) {
if (!nop[i]) prime[tot++]=i;
for (int j=0;j<tot;++j) {
if (1ll*prime[j]*i > 1ll*N) break;
nop[i*prime[j]]=1;
if (i%prime[j]==0) break;
}
}
while (~scanf("%d",&T)) {
while (T--) {
scanf("%lld",&n);
ans = 1;
for (int i=0;i<tot;++i) {
if (n==1ll) break;
if (n%prime[i]!= 0) continue;
k=0;
while (n%prime[i]==0) {
k++;
n/=prime[i];
}
ans = ans*(k+k+1);
}
if (n>1) ans*=3;
//ans = ans * fun(2,MOD-2) % MOD;
//printf("%lld\n",ans*fun(2,MOD-2)%MOD);
ans++;
ans = ans / 2;
printf("%lld\n",ans);
}
}
return 0;
}