Cod sursa(job #442415)
| Utilizator | Data | 14 aprilie 2010 14:42:01 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<cstdio>
const int N=9973;
int main()
{
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
long long x;
scanf("%lld",&x);
int j,nrd=2;
long long s=(1+x)%N;
for (j=2;j*j<x;j++)
if (x%j==0)
{
nrd+=2;
s=(s+j)%N;
s=(s+x/j)%N;
}
if (j*j==x)
{
nrd++;
s=(s+j)%N;
}
printf("%d %d\n",nrd,s);
}
return 0;
}
