Pagini recente » Cod sursa (job #21749) | Cod sursa (job #2798757) | Cod sursa (job #2593184) | Cod sursa (job #1059068) | Cod sursa (job #1808506)
#include <fstream>
#include <bitset>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
bitset<500010> p;
long long n,nd,e,m,np,t,i,j,q[100010];
long long sd,s,k;
int main()
{
for(i=3;i*i<=1000000;i+=2)
if(!p[(i-1)/2])
{
for(j=(i*i-1)/2;j<=500000;j+=i)
p[j]=1;
}
q[++np]=2;
for(i=1;i<=500000;i++)
if(!p[i])
q[++np]=2*i+1;
for(i=1;i<=np;i++)
g<<q[i]<<'\n';
return 0;
f>>t;
for(;t;t--)
{
f>>n;
nd=1;
sd=1;
for(i=1;i<=np;i++)
{
if(1ll*q[i]*q[i]>n)
break;
if(n%q[i]==0)
{
e=1;k=1;s=1;
while(n%q[i]==0)
{
e++;
k*=q[i];
s+=k;
n/=q[i];
}
nd*=e;
sd=(sd*s)%9973;
}
}
if(n>1)
{
nd*=2;
sd=(sd*(n+1))%9973;
}
g<<nd<<" "<<sd<<'\n';
}
return 0;
}