Pagini recente » Cod sursa (job #1020459) | Cod sursa (job #2771863) | Cod sursa (job #1262240) | Cod sursa (job #1410858) | Cod sursa (job #2419206)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("cmmmc.in");
ofstream fout("cmmmc.out");
int n,k,que[400004],v[400004],c[400004],p,u,p1,l,a,n1,s,nr;
long long maxim;
long long comb(int nn,int pp)
{
int nrr=1;
for(int i=nn;i>=(nn-(nn-pp));i--)
nrr*=i;
for(int i=1;i<=nn-pp;i++)
nrr/=i;
return nrr/2;
}
int main()
{
fin>>n;
c[0]=c[1]=1;
for(int i=2;i*i<=45000;i++)
{
if(c[i]==0)
{
v[++n1]=i;
for(int j=i;j*i<=45000;j++)
c[i*j]=1;
}
}
for(int i=1;i<=n;i++)
{
fin>>k;
int k1=k;
s=0;
nr=1;
for(int j=1;j<=n1 && v[j]<=k;j++)
{
if(k%v[j]==0)
{
s++;
int t=0;
while(k%v[j]==0)
{
k/=v[j];
t++;
}
nr*=(t+1);
}
}
if(s%2==0)
nr+=comb(s,s/2);
fout<<nr<<" ";
for(int j=sqrt(k1);j>=1;j--)
{
if(k1%j==0)
{
fout<<min(j,k1/j)<<" "<<max(j,k1/j)<<"\n";
break;
}
}
}
return 0;
}