Pagini recente » Cod sursa (job #565472) | Cod sursa (job #938665) | Cod sursa (job #3263899) | Cod sursa (job #1580781) | Cod sursa (job #2736027)
#include <fstream>
using namespace std;
ifstream fin ("factoriale.in");
ofstream fout("factoriale.out");
int f[111], x[101], v[101], z[101];
int p, n, k, i, j;
long long sol;
int exponent(int x, int p) {
int prod=p;
int s=0;
while(prod <= x) {
s+=x/prod;
prod*=p;
}
return s;
}
int main(){
fin>>n>>k;
for (i=1;i<=n;i++)
fin>>v[i];
for (i=2;i<=110;i++)
if(f[i]==0){
x[++p]=i;
for(j=i+i;j<=110;j+=i)
f[j]=1;
}
for (i=1;i<=n;i++)
for (j=1;j<=p;j++)
z[j]+=exponent(v[i], x[j]);
sol=1;
for (i=1;i<=p;i++) {
if (z[i]==0)
break;
while(z[i]%k!=0){
sol=sol*x[i];
z[i]++;
}
}
fout<<sol;
return 0;
}