Cod sursa(job #2635505)
| Utilizator | Data | 14 iulie 2020 17:54:50 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.15 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long int x,n,m,nrd=1,s=1,nr,p,vd[78499],d;
char v[1000001];
int main()
{
for (int i=2; i<=1000000; i++)
{
if (v[i]==0)
{
nr++;
vd[nr]=i;
v[i]=1;
for (int j=i*2; j<=1000000; j+=i)
{
v[j]=1;
}
}
}
f>>x;
for (int i=0; i<x; i++)
{
f>>n;
m=n;
nrd=1;
s=1;
for (int j=1; j<=78498 && vd[j]*vd[j]<=m && n!=1; j++)
{
if (n%vd[j]==0)
{
p=1;
d=0;
while (n%vd[j]==0)
{
d++;
n=n/vd[j];
p=p*vd[j];
}
p=p*vd[j];
s=s*(p-1)/(vd[j]-1)%9973;
nrd=nrd*(d+1);
}
}
if (n!=1)
{
nrd=nrd*2;
s=s*(n*n-1)/(n-1)%9973;
}
g<<nrd<<' '<<s%9973<<'\n';
}
return 0;
}
