Cod sursa(job #651400)
Utilizator | Data | 20 decembrie 2011 11:30:57 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
void divizor(int n, int &nr, int &s)
{
nr=2; s=1+n;
int i;
for(i=2;i<=sqrtl(n);i++)
if(n%i==0)
{
nr=nr+2;
s=s+i+n/i;
}
if(sqrtl(n)==(int)sqrtl(n))
{
nr=nr-1;
s=s-(int)sqrtl(n);
}
}
int main()
{
int a,x,y,i,t;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>t;
for(i=0;i<t;i++)
{
f>>a;
divizor(a,x,y);
g<<x<<' '<<y<<endl;
}
return 0;
}