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