Pagini recente » Cod sursa (job #2057864) | Cod sursa (job #944211) | Cod sursa (job #2718345) | Cod sursa (job #1127798) | Cod sursa (job #137875)
Cod sursa(job #137875)
#include <stdio.h>
#include <math.h>
int prim[200],v[200],frecv[200],k=0,soli=1;
long long unsigned a[20000];
int main(){
int i,j,x,p,n,ok=1,t=0;
long long unsigned co;
FILE*f=fopen("factoriale.in","r");
FILE*g=fopen("factoriale.out","w");
a[1]=1;
for(i=2;i<=100;i++)
if(!v[i]){
prim[++k]=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;prim[j]<=x && j<=k;j++){
co=prim[j];
while(x/co){
frecv[prim[j]]+=x/co;
co=co*prim[j];
}
}
}
for(i=2;i<=100;i++)
if(frecv[i] && frecv[i]%p){
t=0;
for(j=1;j<=soli || t;j++,t/=10)
a[j]=(t+=a[j]*pow(i,(p-(frecv[i]%p))))%10;
soli=i-1;
}
for(i=soli;i>=1;i--)
if(ok==1 && a[i]) { ok=0; fprintf(g,"%llu",a[i]); }
else if(ok==0) fprintf(g,"%llu",a[i]);
}