Cod sursa(job #1695893)

Utilizator superstar1998Moldoveanu Vlad superstar1998 Data 27 aprilie 2016 22:54:11
Problema Suma si numarul divizorilor Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 3.51 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cctype>

#define pb push_back
#define mp make_pair
#define MAXN 1000001
#define DIM 8192
#define MOD 9973

using namespace std;

class Reader
{
public:
    Reader(const char* filename)
    {
        f.open(filename);
        pos = 0;
        f.read(buffer,DIM);
    }
    inline Reader& operator >>(long long& x)
    {
        x=0;
        sgn=1;
        while((buffer[pos]<'0'||buffer[pos]>'9')&&buffer[pos]!='-')
            if(++pos==DIM)
                f.read(buffer,DIM),pos=0;
        if(buffer[pos]=='-')sgn=-1,pos++;
        while(buffer[pos]>='0'&&buffer[pos]<='9')
        {
            x=x*10+buffer[pos]-'0';
            if(++pos==DIM)f.read(buffer,DIM),pos=0;
        }
        x*=sgn;
        return (*this);
    }
    inline Reader& operator >>(char* c)
    {
        aux = 0;
        while(isspace(buffer[pos]))
            if(++pos==DIM)
                f.read(buffer,DIM),pos=0;
        while(!isspace(buffer[pos]))
        {
            c[aux++]=buffer[pos];
            if(++pos==DIM)f.read(buffer,DIM),pos=0;
        }
        return (*this);
    }
    ~Reader()
    {
        f.close();
    }
private:
    ifstream f;
    int pos,aux,sgn;
    char buffer[DIM];
};

class Writer
{
public:
    Writer(const char* filename)
    {
        g.open(filename);
        pos = 0;
    }
    inline Writer& operator <<(int xx)
    {
        aux = 0;
        x = xx;
        if(xx<0)x=-x;
        if(x==0)
            nr[aux++]='0';
        while(x)
        {
            nr[aux++]=x%10+'0';
            x/=10;
        }
        if(xx<0)nr[aux++]='-';
        while(aux>0)
        {
            buffer[pos++]=nr[--aux];
            if(pos==DIM)g.write(buffer,DIM),pos=0;
        }
        return (*this);
    }
    inline Writer& operator <<(const char* c)
    {
        aux = 0;
        while(c[aux])
        {
            buffer[pos++]=c[aux++];
            if(pos==DIM)g.write(buffer,DIM),pos=0;
        }
        return (*this);
    }
    ~Writer()
    {
        g.write(buffer,pos);
        g.close();
    }
private:
    ofstream g;
    int pos,aux,x;
    char buffer[DIM],nr[21];
};

Reader f("ssnd.in");
Writer g("ssnd.out");
long long t,n,sd,nd,p1,p2,k,j,pp,i;
int p[MAXN];
bitset<MAXN> viz;

void ciur()
{
    p[++k]=2;
    for(i=3;i<MAXN;i+=2)
        if(!viz[i])
        {
            p[++k]=i;
            for(j=i*3;j<MAXN;j+=i*2)
                viz[j]=1;
        }
}

inline long long pow(int x, long long p)
{
    int rez = 1;
    x %= MOD;
    for(;p;p>>=1)
    {
        if(p&1)
        {
            rez*=x;
            rez%=MOD;
        }
        x*=x;
        x%=MOD;
    }
    return rez;
}

int main()
{
    ios_base::sync_with_stdio(false);
    ciur();
    f>>t;
    while(t--)
    {
        f>>n;
        nd=sd=1;
        for(i=1;i<=k&&1LL*p[i]*p[i]<=n;i++)
            if(n%p[i]==0)
            {
                pp=1;
                while(n%p[i]==0)
                {
                    n/=p[i];
                    pp++;
                }
                nd*=pp;
                p1=((pow(p[i],pp)-1)%MOD/(p[i]-1))%MOD;
                p2=pow(p[i]-1, MOD-2) % MOD;
                sd=((sd*p1)%MOD*p2)%MOD;
            }
        if(n>1)
        {
            nd*=2;
            sd=sd*(n+1)%MOD;
        }
        g<<nd<<" "<<sd<<"\n";
    }
    return 0;
}