Cod sursa(job #1687219)
| Utilizator | Data | 12 aprilie 2016 18:45:05 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin ("ssnd.in");
ofstream fout ("ssnd.out");
long long nrt, a, nrdiv=1, sumdiv=1, div, exp1;
int main()
{
fin >> nrt;
for (int i =1; i<= nrt; i++)
{
fin >> a;
div = 2;
sumdiv = 1;
nrdiv = 1;
while (a > 1)
{
exp1=0;
while (a% div == 0 && a > 1){a = a/div; exp1++;}
nrdiv*=(exp1+1);
sumdiv*=((pow(div, exp1+1)-1)/(div-1));
if (div == 2)div++;
else div+=2;
}
fout << nrdiv << ' ' << sumdiv << '\n';
}
return 0;
}
