Pagini recente » Cod sursa (job #3340977) | Cod sursa (job #2590976) | Cod sursa (job #2590989) | Cod sursa (job #1689445) | Cod sursa (job #2055432)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long m=1000000,n,i,j,t,a[1000001],d=1,s=1;
int nr,x;
int pow(int a,int b)
{int i,n=1;
for (i=1;i<=b;i++)
n=n*a;
return n;
}
int main()
{a[2]=1;
for (i=3;i<=m;i=i+2)
a[i]=1;
for (i=3;i<=m;i=i+2)
if (a[i]==1)
for (j=3*i;j<=m;j=j+2*i)
a[j]=0;
cin>>t;
for (i=1;i<=t;i++)
{cin>>n;
for (j=1;j<=sqrt(n);j++)
{nr=0;
if (a[j]==1) while (n%a[j]==0)
{
n=n/a[j];
nr++;
}
d=d*(nr+1);
x=pow(a[j],nr+1);
s=s*(x-1)/(a[j]-1);}
}
cout<<d<<" "<<s;
return 0;}