Cod sursa(job #653907)
Utilizator | Popescu Vali Validator | Data | 29 decembrie 2011 11:25:04 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long nr,i,s,t,n,d,nd;
int main()
{
f>>t;
for(i=1;i<=t;i++)
{
f>>n;
nd=2;
s=1+n;
nr=(int)sqrt((float)n);
for(d=2;d<=nr;d++)
if(n%d==0)
{
nd+=2;
s=(s+d+n/d)%9973;
}
if(n==nr*nr)
{nd--;
s=s-nr;
}
g<<nd<<' '<<s%9973<<'\n';
}
return 0;
}