Cod sursa(job #1757989)
| Utilizator | Data | 16 septembrie 2016 11:08:13 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int v[1000];
int main()
{ int n;
int cunt;
int sum;
FILE *f=fopen("ssnd.in","r"),*g=fopen("ssnd.out","w");
fscanf(f,"%d",&n);
for(int i=1;i<=n;i++)
{
fscanf(f,"%d",&v[i]);
}
for(int i=1;i<=n;i++)
{
cunt=2;
sum=1;
sum=sum+v[i];
for(int d=2;d+d<=v[i];d++)
{
if(v[i]%d==0) cunt++,sum=sum+d;
}
fprintf(g,"%d %d\n",cunt,sum);
}
return 0;
}
