有一个8位的整数，试求它的最右的第一个非0数字，和该数字的右边有几个0。

program divisor;
var
   quotient, remainder : longint;
   i, n : integer;
   start : boolean;
begin
     write('Please enter a eight figure: ');
     readln(quotient);
     start := false;
     for i := 1 to 8 do
     begin
         remainder := quotient mod 10;
         quotient := quotient div 10;
         if (remainder <> 0) and (not start) then
         begin
              write('The end nonzero number is ', remainder);
              start := true;
         end;
         if (remainder = 0) and start then
         begin
              n := n+1;
         end;
     end;
     write(', there are ', n, ' zero''s number before it.');
     readln;
end.