Cod sursa(job #1567233)

Utilizator Costel_DraghiciDraghici Constantin Costel_Draghici Data 12 ianuarie 2016 23:50:55
Problema Suma si numarul divizorilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <iostream>
#define Nmax 78500
#define N  1000000
#include <stdio.h>
using namespace std;
bool v[N+1];
int a[Nmax];
void eratosthenes()
{
     int k=2;
     a[1]=2;
    for(long i=2,j=2;i*j<=N;j++)
        v[i*j]=1;
    for(long i=3;i<=N;i=i+2)
    {
        if(!v[i])
        {
            a[k]=i;
            k++;
            for(long j=2;j*i<=N;j++)
                v[j*i]=1;
        }
    }
    }
int divizori(int x)
{
    int i=1,e=1,p;
    unsigned long long int  y,s=1;
    while(x!=1)
    {
        p=0;y=1;
        if(x%a[i]==0)
        {
            while(x%a[i]==0)
            {x=x/a[i];
            y*=a[i];
            p++;}
            y=(y*a[i]-1)/(a[i]-1);

        }
        i++;
        e=e*(p+1);
        s=(s*y)%9973;
    }
    printf("%d %d\n",e,s);
}
int main()
{
    int t;
    unsigned long long int n;
    eratosthenes();
    freopen("ssnd.in","r",stdin);
    freopen("ssnd.out","w",stdout);
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
        {scanf("%d",&n);
        divizori(n);}

}