Pagini recente » Cod sursa (job #1068181) | Cod sursa (job #1393786) | Cod sursa (job #2717231) | Cod sursa (job #415727) | Cod sursa (job #767961)
Cod sursa(job #767961)
#include <fstream>
#include <math.h>
#define REST 9973
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int ciur ( int );
char a[1000000];
int v[1000000];
int putere (int,int);
int main()
{
int n,k=0,suma,nr,i,x,c,j;
fin>>n;
i=ciur (1000000);
for(i=0;i<n;i++)
{
suma=1;
nr=1;
fin>>x;
j=0;
while(x!=1)
{
c=0;
while (!(x%v[j]))
{
c++;
x=x/v[j];
}
if (c)
{
suma=suma*((putere (v[j],c+1)-1)/(v[j]-1));
nr=nr*(c+1);
}
j++;
}
fout<<nr<<" "<<suma%REST<<"\n";
}
//fout<<v[n+1]*v[n+1];
return 0;
}
int ciur ( int n )
{
int i,j,nr=1,k=0;
v[k++]=2;
for (i=1;(i<<1)+1<=n;i++)
{
if (a[i]=='\0')
{
v[k++]=2*i+1;
nr++;
for(j=i+i+i+1;(j<<1)+1<=n;j+=(i<<1)+1)
a[j]='1';
}
}
return nr;
}
int putere (int n , int k)
{
long long aux;
if (k==1)
return n%REST;
else
{
aux=(putere (n,k/2));
if (k%2)
return ((((aux%REST)*(aux%REST)%REST))*(n%REST)%REST);
else
return ((aux%REST)*(aux%REST)%REST);
}
}