UVA 10892 - LCM Cardinality(数学题)

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <iostream>
using namespace std;
#define MOD 1000000
#define LL long long
int prim[1000001];
int o[1000001];
int main()
{
int i,j,num = 0,temp;
LL n;
for(i = 2;i <= 1000;i ++)
{
if(!o[i])
{
for(j = i+i;j <= 1000000;j += i)
o[j] = 1;
}
}
for(i = 2;i <= 1000000;i ++)
{
if(!o[i])
prim[num++] = i;
}
while(cin>>n)
{
if(!n) break;
cout<<n<<" ";
LL ans = 1;
for(i = 0;i < num;i ++)
{
temp = 0;
while(n%prim[i] == 0)
{
temp ++;
n /= prim[i];
}
ans *= ((temp+1)*2-1);
}
if(n != 1)
ans *= 3;
cout<<ans/2 +1<<endl;
}
return 0;
}