Pagini recente » Cod sursa (job #717085) | Cod sursa (job #1255596) | Cod sursa (job #2148300) | Cod sursa (job #2171346) | Cod sursa (job #137940)
Cod sursa(job #137940)
#include <fstream.h>
#include <math.h>
ifstream fin("factorial.in");
ofstream fout ("factorial.out");
int a[200];
int x[200],n,k;
void citire()
{
fin>>n>>k;
for (int i=0;i<n;i++)
fin>>x[i];
fin.close();
}
void pro()
{
for (int i=0;i<n;i++)
{
int aux1=x[i];
for (int au=2;au<=aux1;au++)
{
int aux=au;
while (aux%2==0)
{
aux/=2;
a[2]++;
}
for (int d=3;d<aux/d;d+=2)
while (aux%d==0)
{
aux/=d;
a[d]++;
}
if (aux!=1)
a[aux]++;
}
}
}
void afisare()
{
long long S=1;
for (int i=0;i<100;i++)
if (a[i]!=0)
S*=pow(i,a[i]%k);
fout<<S<<"\n";
}
int main ()
{
citire();
pro();
afisare();
fout.close();
return 0;
}