Cod sursa(job #883029)
| Utilizator | Data | 19 februarie 2013 17:52:02 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include<stdio.h>
int n;
long a,b,c;
void fugg(long long a,long &b,long &c)
{
long i,osszeg=0,szam=0;
for(i=1;i*i<=a;i++)
{
if(a%i==0)
{
if (i*i==1)
{osszeg=osszeg+i;
szam++;
}
else
{
osszeg=osszeg+i+a/i;
szam=szam+2;
}
}
}
szam++;
b=osszeg+a;
c=szam;
}
int main()
{
FILE *f=fopen("ssnd.in","r");
FILE *g=fopen("ssnd.out","w");
fscanf(f,"%d",&n);
for(int i=0;i<n;i++)
{
fscanf(f,"%ld",&a);
fugg(a,b,c);
fprintf(g,"%ld %ld\n",c,b);
}
fclose(f);
fclose(g);
}
