Cod sursa(job #1014254)
| Utilizator | Data | 22 octombrie 2013 13:11:44 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <cstdio>
#include <cmath>
FILE *f,*g;
using namespace std;
int main(){
f=fopen("ssnd.in","r");
g=fopen("ssnd.out","w");
int t;
long n,i,nr=0,x,j,pp;
char A[1000001];
fscanf(f,"%d",&t);
for(i=1;i<=t;i++)
{
fscanf(f,"%d",&x);
int sum;
long nr;
pp=x/2;
sum=nr=0;
for(j=1;j<=pp;j++)
{
if(x%j==0)
{
nr++;
sum=sum+j;
sum=sum%9973;
}
}
nr++;
sum=sum+x;
sum=sum%9973;
fprintf(g,"%d %d\n",nr,sum);
}
return 0;
}
