Cod sursa(job #575912)
Utilizator | Socaciu-Cumpanasu Bogdan SCBbestof | Data | 8 aprilie 2011 21:29:19 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
unsigned long int i,k;
int t;
unsigned long int v[1000],S;
void citire()
{
FILE *f = fopen("ssnd.in","r");
fscanf(f,"%d",&t);
for(i=1;i<=t;i++)
fscanf(f,"%lu",&v[i]);
fclose(f);
}
void ssnd()
{
unsigned long int j;
FILE *g = fopen("ssnd.out","w");
for(i=1;i<=t;i++)
{
S=0;
k=0;
for(j=1;j<=v[i];j++)
if(v[i]%j==0)
{
S=S+j;
k++;
}
fprintf(g,"%lu %lu\n",k,S);
}
fclose(g);
}
int main()
{
citire();
ssnd();
return 0;
}