Cod sursa(job #2080814)
Utilizator | Data | 3 decembrie 2017 15:45:47 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.87 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("ssnd.in");
ofstream fo("ssnd.out");
int main()
{
int t, n, j, i, c, d, l;
fi>>t;
for (i=1; i<=t; i++)
{
fi>>n;
if (n==1)
fo<<1<<' '<<1<<endl;
else
{
if (n%2==1)
{
l=2;
j=3;
}
else
{
l=1;
j=2;
}
c=2;
d=1+n;
while (j<n/j)
{
if (n%j==0)
{
c=c+2;
d=d+j+n/j;
}
j=j+l;
}
if (j=n/j)
{
c++;
d=d+j;
}
fo<<c<<' '<<d<<endl;
}
}
}