Cod sursa(job #720513)
Utilizator | Vasilescu Ioan Cameleonul | Data | 22 martie 2012 18:28:44 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long sumadiv=1,nrdiv=1,a;
void descompunere(int n)
{
long long d=2;
long double p;
nrdiv=1;
sumadiv=1;
while(n>1)
{
p=0;
while(n%d==0)
{
p=p+1;
n=n/d;
}
if(p)
nrdiv=(p+1)*nrdiv;
sumadiv=sumadiv*((pow(d,p+1)-1)/(d-1));
d=d+1;
}
g<<nrdiv<<' '<<sumadiv;
}
int main()
{
int t,i;
f>>t;
for(i=1;i<=t;i++)
{
f>>a;
descompunere(a);
g<<'\n';
}
f.close();
g.close();
return 0;
}