Pagini recente » Cod sursa (job #1539085) | Cod sursa (job #2277331) | Cod sursa (job #190940) | Cod sursa (job #777721) | Cod sursa (job #161491)
Cod sursa(job #161491)
#include <stdio.h>
#define N 120
int puteri[N],A[N];
int n,k;
void mul(int A[], int B)
{
int i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= 10)
A[i] = (t += A[i] * B) % 10;
A[0] = i - 1;
}
void descompune(int x)
{
int i,j,y;
for(j=2;j<=x;++j)
{
y=j;
for(i=2;i<=j;++i)
{
if(y%i==0)
while(y%i==0)
{
y/=i;
++puteri[i];
}
if(y<=1) break;
}
}
}
int main()
{
int x,i,j;
A[0]=1; A[1]=1;
freopen("factoriale.in", "r",stdin);
freopen("factoriale.out", "w",stdout);
scanf("%d%d", &n,&k);
for(i=1;i<=n;++i)
{
scanf("%d", &x);
descompune(x);
}
/*for(i=1;i<=15;++i)
printf("%d %d\n",i,puteri[i]);*/
for(i=1;i<=100;++i)
{
if(puteri[i]>0)
{
if(puteri[i]%k!=0)
for(j=1;j<=k-(puteri[i]%k);++j,mul(A,i));
}
}
for(i=A[0];i>=1;--i)
printf("%d", A[i]);
return 0;
}