Cod sursa(job #590140)
Utilizator | Horia Cretescu ELHoria | Data | 15 mai 2011 17:25:16 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
#include <cmath>
const int NMAX = 1000000;
bool p[10000000];
int n , rad , nr , d , sum;
void ciur()
{
for(int i=3;i<=NMAX;++i)
if(!p[i])
for(int j=i+i;j<=NMAX;j+=i)
p[j]= true ;
}
int main()
{
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
scanf("%d",&n);
//ciur();
for(int k=0;k<n;++k)
{
scanf("%d",&nr); r//ad=(int)sqrt(nr);
int i;
for(i=2, d=1 ,sum = 1 ;i<=nr;++i)
if(nr%i==0) ++d,sum+=i%9973;
printf("%d %d\n",d,sum);
}
return 0;
}