Cod sursa(job #624667)
Utilizator | Data | 22 octombrie 2011 16:52:21 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
var f,g:text;k,i,n,j:integer;
begin
assign(f,'fact.in');reset(f);
assign(g,'fact.out');rewrite(g);
read(f,n);
repeat
i:=i+5;
k:=k+1;
if(i div 10mod 10=2)and(i mod 10=5) then k:=k+1;
if i mod 100=0 then begin j:=i;
repeat
k:=k+1;
j:=j div 10;
until j mod 10<>0;end;
until k=n;
write(g,i);
close(F);
close(G);end.