Pagini recente » Cod sursa (job #2265063) | Cod sursa (job #2632483) | Cod sursa (job #1736944) | Cod sursa (job #3228963) | Cod sursa (job #2738104)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("factoriale.in");
ofstream fout ("factoriale.out");
long long f[105];
long long n, k;
long long x, y;
long long sol=1;
int main (){
fin>>n>>k;
for(long long i=1; i<=n; i++){
fin>>x;
for(long long j=2; j<=x; j++){
y=j;
while(y%2 == 0){
f[2]++;
y/=2;
}
for(long long d=3; d<=y/d; d+=2)
while(y%d == 0){
f[d]++;
y/=d;
}
if(y != 1)
f[y]++;
}
}
for(long long i=2; i<=100; i++)
if(f[i] != 0)
while(f[i]%k != 0){
f[i]++;
sol *= i;
}
fout<<sol;
return 0;
}