Pagini recente » Cod sursa (job #2574043) | Stelele Informaticii 2009, clasele 9-10, ziua 1 | Cod sursa (job #1046940) | Cod sursa (job #1861831) | Cod sursa (job #137944)
Cod sursa(job #137944)
#include<fstream.h>
#include<iomanip.h>
#include<math.h>
ifstream f("factoriale.in");
ofstream g("factoriale.out");
int puteri[100],l,n,k,x;
void mark_div(int l)
{
int aux=l,d=2;
while(aux!=1)
{
if(aux%d==0)
while(aux%d==0)
{puteri[d]++;aux/=d;}
d++;
}
}
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{f>>x;
for(int l=2;l<=x;mark_div(l),l++);
}
long double sol=1;
for(int i=2;i<=97;i++)
{
if (puteri[i]) sol*=(long double)pow(i,puteri[i]%k);
}
g<<(long long)sol;
f.close();
g.close();
return 0;
}