Cod sursa(job #111245)
| Utilizator | Data | 28 noiembrie 2007 21:40:28 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
{suma pan la n! si se da un nr p.gasesc cel mai mic nr cu p cifre
de la 0 la sfarsit}
program factorial;
var f:text;
p,produs,n,nr,c:int64;
i:longint;
begin
assign(f,'fact.in'); reset(f); readln(p); close (f);
n:=1;
produs:=1;
i:=1;
repeat
produs:=produs*i;
i:=i+1;
while(p<>0) do begin
c:=produs mod 10;
produs:=produs div 10;
p:=p-1;
end;
until p=0;
assign(f,'fact.out');
rewrite(f);
if (p=0) and (produs=0) then write(i)
else write(-1);
close(f);
end.
