Pagini recente » Cod sursa (job #1730906) | Cod sursa (job #360858) | Cod sursa (job #108360) | Cod sursa (job #1650659) | Cod sursa (job #1401314)
#include <stdio.h>
#include <string.h>
int v[105],a[100001],frecv[105],prim[105];
void mul(int A[100000], 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;
}
int main(){
int x,n,p,i,j;
long long unsigned o;
FILE*f=fopen("factoriale.in","r");
FILE*g=fopen("factoriale.out","w");
for(i=2;i<=100;i++)
if(!v[i]){
prim[++prim[0]]=i;
for(j=i+i;j<=100;j+=i)
v[j]=1;
}
fscanf(f,"%d%d",&n,&p);
for(i=1;i<=n;i++){
fscanf(f,"%d",&x);
for(j=1;j<=prim[0]&&prim[j]<=x;j++){
o=prim[j];
while(x/o){
frecv[prim[j]]+=x/o;
o*=prim[j];
}
}
}
a[0]=1;
a[1]=1;
for(i=2;i<=100;i++)
if(frecv[i] && frecv[i]%p){
for(j=1;j<=p-(frecv[i]%p);j++)
mul(a,i);
}
for(i=a[0];i>=1;i--)
fprintf(g,"%d",a[i]);
return 0;
}