Pagini recente » Cod sursa (job #111674) | Cod sursa (job #1421320) | Cod sursa (job #698494) | Cod sursa (job #604899) | Cod sursa (job #137244)
Cod sursa(job #137244)
#include<fstream.h>
#include<iostream.h>
int main()
{
int a,i,j;
int xn,x;
int n,k;
long long div[100]={0};
int dmax=0;
ifstream fin("factor~1.in");
ofstream fout("factoriale.out");
fin>>n>>k;
for(a=0;a<n;a++)
{ fin>>xn;
for(i=2;i<=xn;i++)
{ j=2; x=i;
while(x!=1)
{ while(!(x%j))
{ x/=j;
div[j]++;
if(dmax<j) dmax=j;
}
j++; }
}
}
unsigned long long plus=1;
if(div[2]%k) plus=2*(div[2]+div[2]%k);
for(i=3;i<=dmax;i+=2)
if(div[i])
if(div[i]%k)
{ j=1;
while(div[i+j]%k) j++;
plus*=i*j;
}
fout<<plus<<endl;
fin.close();
fout.close();
return 0;
}