Cod sursa(job #577552)
| Utilizator | Data | 10 aprilie 2011 13:24:14 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
short t;
long long n,i,j,S;
int contor;
FILE *intrare,*iesire;
intrare=fopen("ssnd.in","r");
fscanf(intrare,"%d",&t);
iesire=fopen("ssnd.out","w");
for(i=1;i<=t;i++)
{
fscanf(intrare,"%lld",&n);
S=1;
contor=2;
for(j=2;j<=n/2;j++)
{
if(n%j==0)
{ S=S+j; contor++;}
}
fprintf(iesire,"%d %lld\n",contor,S+n);
}
fclose(intrare);
fclose(iesire);
return 0;
}
