Pagini recente » Cod sursa (job #2976844) | Cod sursa (job #1671470) | Cod sursa (job #1027074) | Cod sursa (job #1726223) | Cod sursa (job #2730967)
#include <fstream>
using namespace std;
ifstream cin("factoriale.in");
ofstream cout("factoriale.out");
long long f[105], x, cnt, d, nr, i, j, k, n, p, nrr;
int main(){
cnt=1;
nrr=1;
cin>>n>>k;
for(i=1;i<=n;i++){
cin>>x;
p=1;
for(j=2;j<=x;j++){
p=j;
d=2;
while(p>1){
while(p % d == 0){
f[d]++;
p /= d;
}
d++;
if(p>1 && d * d > p){
d = p;
}
}
}
}
for(i=2;i<=97;i++){
if(f[i]!=0){
nr=k-f[i];
cnt=1;
for(j=1;j<=nr;j++)
cnt=cnt*i;
nrr=nrr*cnt;
}
}
cout<<nrr;
}