Pagini recente » Cod sursa (job #1166530) | Istoria paginii preoni-2007/runda-1/solutii | Cod sursa (job #2051071) | Cod sursa (job #2473103) | Cod sursa (job #11247)
Cod sursa(job #11247)
program cel;
var f,g:text;
n,p,fact,r:longint;
Begin
Assign(f,'fact.in');Reset(f);
Assign(g,'fact.out');Rewrite(g);
Read(f,p);
n:=0;
fact:=0;
While p>n do
Begin
inc(fact,25);
r:=fact;
If (r div 25) mod 5=0 then While r mod 5=0 do
Begin
r:=r div 5;
inc(n)
end
else inc(n,2);
inc(n,4);
end;
While n>p do
Begin
r:=fact;
While (r mod 5=0) and (n>p) do
Begin
dec(n);
r:=r div 5;
end;
dec(fact,5);
end;
If n=0 then Write(g,1)
else Write(g,fact);
Close(f);
Close(g);
end.