Cod sursa(job #652371)
Utilizator | Data | 24 decembrie 2011 10:55:11 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <cmath>
using namespace std;
long long n,i,t,s,nr,j;
int main()
{
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>n;
for (i=1;i<=n;i++) {
f>>t;
s=1+t;
nr=2;
for (j=2;j<=trunc(sqrt(t));j++)
if (t%j==0) {s=s+j+t/j;nr=nr+2;}
g<<nr<<' '<<s<<'\n';
}
f.close();
g.close();
return 0;
}