Cod sursa(job #919504)

Utilizator vladvaldezVlad Dimulescu vladvaldez Data 19 martie 2013 18:19:44
Problema Suma si numarul divizorilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <stdio.h>

using namespace std;
FILE *f=fopen("ssnd.in","r");
FILE *g=fopen("ssnd.out","w");

short cr[1000010];
int i,j,x,t,p;
int nrd,sd;
long long a1,a2;
const int mod=9973;

void ciur()
{
 int i,j;
 for(i=3;i<=1000001;i+=2)
  if (cr[i]==0)
   for(j=i+i;j<=1000001;j+=i)
    cr[j]=1;
}

long long ridic (int n,int k)
{
 long long a=n,p=1;
 int i;
 for(i=0;(1<<i)<=k;i++)
 {
 if (((1<<i)& k)>0) p=(p*a)%mod;
 a=(a*a)%mod;
 }
 return p;
}

int main()
{
fscanf(f,"%d",&t);
ciur();
for(i=1;i<=t;i++)
{
fscanf(f,"%d",&x);
nrd=1;
sd=1;
for(j=2;j*j<=x;j++)
  if (cr[j]==0 && x%j==0)
  {
    p=0;
    while(x%j==0){p++;x=x/j;}
    nrd*=(p+1);
    a1=(ridic(j,p+1)-1)%mod;
    a2=(ridic(j-1,mod-2))%mod;
   sd=((sd%mod)*(a1*a2)%mod)%mod;
  }
if (x!=1)
 {
  nrd*=2;
  a1=(ridic(x,2)-1)%mod;
  a2=(ridic(x-1,mod-2))%mod;
  sd=((sd%mod)*(a1*a2)%mod)%mod;
 }

 fprintf(g,"%d %d\n",nrd,sd);
}

fclose(g);
return 0;
}