Cod sursa(job #2039981)
| Utilizator | Data | 15 octombrie 2017 11:41:36 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.95 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
bool a[1000001]={0};
void nr_prime()
{
for(int i=2;i<=1000000;i++)
{
if(a[i]==0)
for(int j=i;j<=1000000;j+=i)
a[j]=0;
}
}
int descompunere(int n)
{
int nd=1,sd=1;
for(int i=2;i<=1000000&&sqrt(n)>1;i++)
{
if(a[i]==0)
{
int p=0;
while(n%i==0)
{
p++;
n=n/i;
}
if(p)
{
nd*=p+1;
sd*=(pow(i,(p+1))-1)/(i-1);
}
}
}
g<<nd<<" "<<sd;
g<<endl;
}
int main()
{
nr_prime();
int t,n;
f>>t;
for(int j=0;j<t;j++)
{
f>>n;
descompunere(n);
}
return 0;
}
