> const a:array[1..12] of longint=(5,25,125,625,3125,15625,78125,390625,1953125,9765625,48828125,244140625);
>       c:array[1..12] of longint=(1,6,31,156,781,3906,19531,97656,488281,2441406,12207031,61035156);
> var i,j,n,m,l,t,k:longint;
> begin
>   readln(m);
>   for l:=1 to m do begin
>     t:=0;
>     readln(n);
>     for i:=12 downto 1 do
>       while n>=a[i] do begin t:=t+c[i]; n:=n-a[i]; end;
>     writeln(t);
>   end;
> end.
> 
> 求大牛们的16ms做法

• Re:进位制思想~47ms (3) zycxy 2011-09-16 13:52:24