Mai intai trebuie sa te autentifici.
Cod sursa(job #1240179)
Utilizator | Data | 10 octombrie 2014 17:24:09 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.25 kb |
#include<fstream>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
long long mare=1000001,i,j,suma,viz[1000001],numar,t,n,p,geometrica,m,x,OK,k,X[1000000];
int main()
{
fin>>t;
for(i=2;i*i<=mare;i++)
{
if(viz[i]==0)
{
for(j=2;i*j<=mare;j++)
viz[i*j]=1;
X[++k]=i;
}
}
for(i=1;i<=t;i++)
{
fin>>n;
x=n;
numar=suma=1;OK=1;
for(j=1;X[j]*X[j]<=n;j++)
{
if(!viz[X[j]] && x%X[j]==0 && x>1)
{
OK=0;
p=0;
while(x%X[j]==0)
{
x=x/X[j];
p++;
}
geometrica=1;
numar=numar*(p+1);
for(m=1;m<=p+1;m++)
geometrica=geometrica*X[j];
geometrica--;
geometrica=geometrica/(X[j]-1);
suma=suma*geometrica%9973;
}
}
if(OK)
{
numar=2;
suma=1+n;
}
fout<<numar<<" "<<suma%9973<<"\n";
}
return 0;
}