Cod sursa(job #862440)

Utilizator vladvaldezVlad Dimulescu vladvaldez Data 22 ianuarie 2013 18:19:43
Problema Suma si numarul divizorilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.22 kb
#include <iostream>
#include <stdio.h>
#include <math.h>


using namespace std;

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

const int n=1000000;
int i,a,nr,p,prim[n],cnt=0;




void ciur()
{
    int i,j;

    for (i=2;i<=n;i++)
    prim[i]=1;

    for (i=2;i<=n;i++)
        if (prim[i])
        {
            cnt++;
            for (j = 2*i;j<=n;j+=i)
                prim[j] = 0;
        }
}







void desc(int nr)
{
    long long nr2,x,dv=1,sum=1;
    int i=0,d;
    int cnr=nr;

    for(i=2;i<=sqrt(cnr);i++)
    if(prim[i])
    {

        d=1;
        while(nr%i==0){d++;nr/=i;}
        dv=(long long)(d*dv)%9973;
        if(d>1)
        {
            x=i;
            x=(long long)pow(x,d);
            x--;
            x/=(i-1);
            sum=(long long)(sum*x)%9973;
        }


    }

    if(nr>1)
    {
        dv=(dv*2)%9973;
        nr2=(nr+1)%9973;
        sum=(sum*nr2)%9973;
        }



    fprintf(g,"%lld ",dv);
    fprintf(g,"%lld\n",sum);



}



int main()
{
    ciur();
    fscanf(f,"%d",&a);
    for(i=1;i<=a;i++)
    {
        fscanf(f,"%lld",&nr);
        desc(nr);
    }


    fclose(g);
    return 0;
}