Pagini recente » Cod sursa (job #179014) | Cod sursa (job #1690347) | Cod sursa (job #1494589) | Cod sursa (job #1713997) | Cod sursa (job #930098)
Cod sursa(job #930098)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int z=1,n,j,x,p,d,s,k,i,u;
char a[1000001],b[1000001];
int main()
{
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
fin>>n;
for(j=1;j<=n;j++)
{
fin>>n;k=2;x=n;n=sqrt(n);d=1;s=1;
while(k<=n)
{
while(x%k==0)
{
x=x/k;
b[k]++;
}
a[k]=1;
p=k;
while(p+k<=n)
{
p=p+k;
a[p]=1;
}
for(i=k;i<=1000000;i++)if(a[i]==0){k=i;i=1000001;}
if(i==1000001)k=1000001;
}
for(i=1;i<=n;i++)
{
if(b[i]>0)
{
d=d*(b[i]+1);
z=1;
u=i;
while(u>0)
{
z*=b[i];
u--;
}
s*=(z-1)/(b[i]-1);
}
}
fout<<d<<" "<<s<<"\n";
}
fin.close();
fout.close();
return 0;
}