Pagini recente » Cod sursa (job #2021903) | Cod sursa (job #2836251) | Cod sursa (job #2022597) | Cod sursa (job #3137845) | Cod sursa (job #930702)
Cod sursa(job #930702)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int z=1,n,j,x,p,d,s,k,i,u,m;
int a[1000009],b[1000009];
int main()
{
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
fin>>m;
for(j=1;j<=m;j++)
{
fin>>n;k=2;x=n;n=sqrt(n);d=1;s=1; // cout<<n;
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=1000002;}
if(i==1000001)k=1000001;
} //for(i=1;i<=n;i++)cout<<b[i]; cout<<endl;
for(i=1;i<=n;i++)
{
if(b[i]>0)
{
d=d*(b[i]+1);
z=1;
u=i+1;
while(u>0)
{
z*=b[i];
u--;
}
s*=(z-1)/(b[i]-1); // cout<<s;
}
}
fout<<d<<" "<<s<<"\n";
}
fin.close();
fout.close();
return 0;
}