Pagini recente » Cod sursa (job #2098571) | Cod sursa (job #935935) | Cod sursa (job #1724104) | Cod sursa (job #2536446) | Cod sursa (job #1007790)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin ("ssnd.in");
ofstream fout ("ssnd.out");
int t, n, nrp, nrdiv, sdiv, nrput, aux;
bool p[1000000];
void ciur()
{
for (int i=3; i*i<1000000; i+=2)
for (int j=i*i; j*j<1000000; j+=2*i)
p[j]=true;
}
void rezolv(int i)
{
nrput=0;
while(n%i==0)
{
nrput++;
n/=i;
}
nrput++;
int q=pow(i, nrput);
q=q-1;
q/=(i-1);
q%=9973;
sdiv*=q;
nrdiv*=nrput;
nrput=0;
}
int main()
{
ciur();
fin>>t;
for (int i=0; i<t; i++)
{
nrdiv=1;
sdiv=1;
fin>>n;
rezolv(2);
for (int i=3; i<=n; i+=2)
if (p[i]==false)
rezolv(i);
fout<<nrdiv<<" "<<sdiv%9973<<"\n";
}
return 0;
}