Pagini recente » Cod sursa (job #1964444) | Cod sursa (job #2811646) | Cod sursa (job #1377120) | Cod sursa (job #32893) | Cod sursa (job #2729912)
#include <fstream>
using namespace std;
ifstream fin("factoriale.in");
ofstream fout("factoriale.out");
int n,k,i,j,m,prod,v[101],p[101],e[101];
unsigned long long x;
bool f[101];
int main() {
fin>>n>>k;
for (i=1;i<=n;i++)
fin>>v[i];
for (i=2;i<=100;i++)
if (f[i]==0) {
p[++m]=i;
for (j=2*i;j<=100;j+=i)
f[j]=1;
}
for (i=1;i<=n;i++)
for (j=1;j<=m;j++) {
prod=p[j];
while (prod<=v[i]) {
e[j]+=v[i]/prod;
prod*=p[j];
}
}
x=1;
for (i=1;i<=m;i++) {
if (e[i]==0)
break;
while (e[i]%k!=0) {
x*=p[i];
e[i]++;
}
}
fout<<x;
return 0;
}