Cod sursa(job #1245850)
| Utilizator | Data | 20 octombrie 2014 09:31:40 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
int t,i,j,d,nr;
long long n,nd,sd,p,aux;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int main()
{
f>>t;
for (i=1; i<=t; i++)
{
f>>n;
d=2;
aux=n;
nd=1; sd=1;
while (aux>1)
{
nr=0; p=d;
while (aux%d==0)
{
nr++;
p = p*d;
aux=aux/d;
}
if (nr>0)
{
nd = nd*(nr+1);
sd = sd*(p-1)/(d-1);
}
d++;
}
g<<nd<<" "<<sd<<'\n';
}
return 0;
}
