Pagini recente » Cod sursa (job #471604) | Cod sursa (job #2545709) | Cod sursa (job #349576) | Cod sursa (job #2506900) | Cod sursa (job #581973)
Cod sursa(job #581973)
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long prim[10001];
long long ma,i,j;
void ciur(long long num)
{ int a;
a=num/10;
for(i=2;i<=a;i++)
prim[i]=1;
for(i=2;i<=a;i++)
if(prim[i])
for(j=i*i;j<=a;j+=i)
prim[j]=0;
}
int main()
{ long long nr,suma;
int t,fm,v[1001];
double baza,exponent;
f>>t;
for(j=1;j<=t;j++)
{f>>v[j]; if(ma<v[j]) ma=v[j];} ciur(ma);
for(j=1;j<=t;j++)
{ nr=suma=1;
if(prim[v[j]])
{nr*=2; suma*=(1+v[j]);}
else
{i=baza=2;
do
{fm=exponent=0;
while(v[j]%i==0)
{fm++; exponent++;
v[j]/=i;}
nr*=(fm+1);
suma*=(pow(baza,(exponent+1))-1)/(i-1);
if(prim[v[j]]==0 ) {i++; baza++;}
else i=v[j];
}
while(v[j]!=1);
}
g<<nr<<" "<<suma%9973<<'\n';}
}