Cod sursa(job #898508)
| Utilizator | Data | 28 februarie 2013 10:32:46 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<stdio.h>
FILE *in,*out;
int v[1000001],i,n,j,s,kontor,rasp;
bool wtf;
int main()
{
in=fopen("ssnd.in","rt");
out=fopen("ssnd.out","wt");
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
fscanf(in,"%d",&v[i]);
for(i=1;i<=n;i++)
{
kontor=1;
s=1;
for(j=2;j<=v[i];j++)
{
if(v[i]%j==0)
{
s+=j;
kontor++;
rasp=s%9973;
}
}
fprintf(out,"%d %d \n",kontor,rasp);
}
fclose(in);
fclose(out);
return 0;
}
