Cod sursa(job #589980)
Utilizator | Data | 14 mai 2011 20:44:28 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
#include <cmath>
FILE *g,*z;
using namespace std;
int main()
{
g=fopen("ssnd.in","r");
z=fopen("ssnd.out","w");
long long int i,t,n,s=0,j,ct;
fscanf(g,"%llu",&t);
for(i=1;i<=t;i++)
{
s=0; ct=0;
fscanf(g,"%llu",&n);
for(j=1;j<=n;j++)
{
if(n%j==0)
{
s+=j;
ct++;
}
}
fprintf(z,"%llu %llu\n",ct,s);
}
return 0;
}