Pagini recente » Cod sursa (job #615635) | Cod sursa (job #1492069) | Cod sursa (job #1447533) | Cod sursa (job #1501938) | Cod sursa (job #1575154)
#define Nmax 78500
#define MOD 9973
#define N 1000000
#include <stdio.h>
using namespace std;
int v[N+1];
int a[Nmax];
int eratosthenes()
{
int k=1;
for(int i=2;i<=N;i++)
{
if(!v[i])
{
a[k++]=i;
for(int j=2;j*i<=N;j++)
v[j*i]=1;
}
}
return k;
}
int divizori(int k,int x)
{
int e=1,p,s=1;
long long y;
for(int i=1;i<=k && 1LL*a[i]*a[i]<=x;i++)
{
p=0;y=1;
if(x%a[i])
continue;
else
{
while(x%a[i]==0)
{x=x/a[i];
y*=a[i];
p++;}
y=(y*a[i]-1)/(a[i]-1);
}
if(p && y!=1)
{e=e*(p+1);
s=(s*y)%MOD;}
}
printf("%d %d\n",e,s);
}
int main()
{
int t,k;
long long n;
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
k=eratosthenes()-1;
scanf("%d",&t);
for(int i=1;i<=t;i++)
{scanf("%lld",&n);
divizori(k,n);}
}