Pagini recente » Cod sursa (job #2177481) | Cod sursa (job #1032185) | Cod sursa (job #2835772) | Cod sursa (job #2149070) | Cod sursa (job #1379088)
#include <fstream>
#include <cmath>
#include <cassert>
#define NMAX 1000010
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
bool q[NMAX];
long long i,j,cntciur,ciur[120000],n,x;
int main()
{
q[1]=1;
for(i=2; i*i<=NMAX; i++)
if(q[i]==0)
{
for(j=i*i; j<=NMAX; j+=i) q[j]=1;
}
for(i=1; i<=NMAX; i++) if(q[i]==0)
{
cntciur++;
ciur[cntciur]=i;
}
in>>n;
for(i=1; i<=n; i++)
{
in>>x;
long long cx;
cx=x;
int nr=1;
long long nrdiv=1,sumadiv=1,put=0;
while(ciur[nr]*ciur[nr]<=x or cx!=1)
{
int put=0;
while(cx%ciur[nr]==0)
{
put++;
cx=cx/ciur[nr];
}
sumadiv=sumadiv*(pow(ciur[nr],put+1)-1)/(ciur[nr]-1);
nrdiv=nrdiv*(put+1);
nr++;
}
assert(cx == 1);
out<<nrdiv<<" "<<sumadiv<<'\n';
}
in.close();
out.close();
return 0;
}