Pagini recente » Cod sursa (job #1582865) | Cod sursa (job #1065410) | Cod sursa (job #1780227) | Cod sursa (job #1919456) | Cod sursa (job #639472)
Cod sursa(job #639472)
#include<fstream>
#include<math.h>
using namespace std;
int main()
{
int a[10000],i,j,b[10000],d[1001],n,max,u,k;
long long s,nr,in,numar;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>n;
a[1]=2;
u=1;
b[2]=2;
max=sqrt(max);
max=50000;
for(i=2;i<=max;i++)
b[i]=i*2-1;
for(i=2;i<=max;i++)
if(b[i]!=0)
{
a[++u]=b[i];
for(j=i+b[i];j<=max;j+=b[i])
{
b[j]=0;
}
}
for(i=1;i<=n;i++)
{
f>>numar;
s=1;
nr=1;
for(j=1;j<=sqrt(numar);j++)
{
if(numar%a[j]==0)
{
in=0;
k=numar;
do
{
k/=a[j];
in++;
}
while(k%a[j]==0);
s=s*((pow(a[j],in+1)-1)/(a[j]-1));
nr*=(in+1);
}
}
if(s==1&&nr==1)
{
nr=2;
s=(d[i]*d[i]-1)/(d[i]-1);
}
g<<nr<<" "<<s<<"\n";
}
return 0;}