Cod sursa(job #1360724)

Utilizator Seb16Ungureanu Paul Sebastian Seb16 Data 25 februarie 2015 17:28:46
Problema Suma si numarul divizorilor Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.31 kb
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int p, t, nr, len;
bool v[10000001];
long long s, n;
int putere(int nr, int putere)
{
    int nrputere=nr;
    for(int i=1; i<putere; i++)
    {
        nrputere=nrputere*nr;
    }
    return nrputere;
}
void ciur()
{
    for(int i=3; i<=10000000; i=i+2)
    {
        if(v[i]==0)
        {
            for(int j=i+i; j<=10000000; j=j+i)
            {
                v[j]=1;
            }
        }
    }
}
int main()
{
    ciur();
    fin>>t;
    for(int i=1; i<=t; i++)
    {
        fin>>n;
        s=1;
        nr=1;
        len=sqrt(n);

        p=0;
        while(n%2==0)
        {
            n=n/2;
            p++;
        }
        nr=nr*(p+1);
        s=s*((putere(2, p+1)-1));

        for(int j=3; j<=len; j=j+2)
        {
            if(v[j]==0)
            {
                p=0;
                while(n%j==0)
                {
                    n=n/j;
                    p++;
                }
                nr=nr*(p+1);
                s=s*((putere(j, p+1)-1)/(j-1));
            }
        }
        if(n>1)
        fout<<"2 "<<n+1<<'\n';
        else
        fout<<nr<<' '<<s<<'\n';
    }
    fin.close();
    fout.close();
    return 0;
}