Cod sursa(job #807809)

Utilizator tibi2012Galatanu Tiberiu tibi2012 Data 5 noiembrie 2012 19:18:09
Problema Ciurul lui Eratosthenes Scor 0
Compilator fpc Status done
Runda Arhiva educationala Marime 0.26 kb
Raporteaza aceasta sursa 
var n,k,c:longint;
    v:array[1..10] of longint=(1,5,25,125,625,3125,15625,78125,390625,1953125);
begin
  readln(n);
  c:=0;
  k:=0;
  while n>0 do
    begin
      inc(c);
      k:=k+((n mod 10+1) div 2)*v[c];
      n:=n div 10;
    end;
  writeln(k);
end.