Cod sursa(job #1644748)
Utilizator | verciuc stefan verciuc_stefan | Data | 10 martie 2016 09:09:52 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
void prop(int x)
{
int p=0,nr=1,x1=x,s=0,i;
for(i=2;i*i<=x;i++)
{while(x1%i==0)
{
x1=x1/i;
p++;
}nr=nr*(p+1);
p=0;
}
for(i=1;i<=x;i++)
if(x%i==0)
{
s=s+i;
if(s>9973)
s=s/9973;
}
g<<nr<<' '<<s<<endl;
}
int main()
{long long y;
int x,k;
f>>y;
for(k=1;k<=y;k++)
{
f>>x;
prop(x);
}
return 0;
}