Cod sursa(job #2647950)
Utilizator | Truta Robert roberttruta | Data | 7 septembrie 2020 16:36:28 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.23 kb |
#include <fstream>
#include <bitset>
using namespace std;
const int k=1000005;
long long x,y,nr,s,X,z,p;
int i,j,t,n,u[100000];
bool v[k];
int main()
{
ifstream f("ssnd.in");
ofstream g("ssnd.out");
for(i=2;i*i<k;i++)
if(!v[i])
for(j=i*i;j<k;j+=i)
v[j]=1;
for(i=2;i<k;i++)
if(!v[i])
u[++t]=i;
f>>n;
for(i=1;i<=n;i=i+1)
{
f>>x;s=1;nr=1;X=x;
for(j=1;1LL*u[j]*u[j]<=x;j++)
{
if(x%u[j]==0)
{
p=0;y=1;
while(X%u[j]==0)
{
p++;
X=X/u[j];
}
nr=nr*(p+1);
p++;z=u[j];
while(p)
{
if(p%2==1)
{
p--;
y*=z;
}
z*=z;
p/=2;
}
y--;
s*=y;
s/=(u[j]-1);
s%=9973;
}
}
if(X!=1)
{
nr=nr*2;
s*=(X+1);
s%=9973;
}
g<<nr<<' '<<s<<'\n';
}
return 0;
}