Cod sursa(job #758141)
Utilizator | Data | 14 iunie 2012 16:27:11 | |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | c | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <stdio.h>
#include <stdlib.h>
int s=0;
int putere(int a)
{
int k=5;
s=0;
while(a >= k)
{
s=s+(a/k);
k=k*5;
}
}
int cautare (int p)
{
int i;
for (i=4*p; i<=5*p; i++)
{
putere(i);
if(s==p)
return i;
}
}
int main()
{
FILE *pf,*fp;
int p,n;
pf=fopen("fact.in", "r");
fscanf(pf,"%d", &p);
fclose(pf);
if(p==0)
n=1;
else
n=cautare(p);
fp=fopen("fact.out", "w");
fprintf(fp,"%d", n);
fclose(fp);
}