Cod sursa(job #653558)
| Utilizator | Data | 28 decembrie 2011 12:48:08 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 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;
}
if(n/nr==nr)
{nd--;
s=s-nr;
}
g<<nd<<' '<<s%9973<<'\n';
}
return 0;
}
