Pagini recente » Cod sursa (job #2411287) | Borderou de evaluare (job #2395890) | Borderou de evaluare (job #2022894) | Cod sursa (job #2257962) | Cod sursa (job #581820)
Cod sursa(job #581820)
#include<fstream>
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;
}
long long powA(int baza, int exponent)
{int k; long long putere;
putere=1;
for(k=1;k<=exponent+1;k++)
putere*=baza;
return putere;
}
int main()
{ long long nr,suma;
int t,fm,v[1001];
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=2;
do
{fm=0;
while(v[j]%i==0)
{fm++;
v[j]/=i;}
nr*=(fm+1);
suma*=(powA(i,fm)-1)/(i-1);
if(prim[v[j]]==0 ) i++;
else i=v[j];
}
while(v[j]!=1);
}
g<<nr<<" "<<suma%9973<<'\n';}
}