🚀 go-pugleaf

In article <4gaucn$cdu@beyond.escape.com>,
Ken Nahshon <viking@escape.com> wrote:
>Who origianlly asked about this problem...?
>This person is obviousely a serious loser because this was one of the 
>qualifying round problems for the United States of America Computing 
>Olypiad(USACO).  The problem is EXTREMELY simple.  All that must be done 
>is remove all the trailing zeros after each iteration and (the way I did 
>it) minus 10000 from the total if the total is greater than 10000.  
>Another, cleaner solution is to use the modulus operator.  
>
>ps I did this, and speak from expierience. MINE WORKS! :)


So after you have finished the n-th iteration, you have multiplied your
number by n, removed the trailing zeros, and subtracted 10000 until the
number is not greater than 10000. Are you claiming that you end up with
a number with the same last digit as n! ?

Strictly speaking this is not correct.

Take the 3125-th iteration. Your algorithm yields 995. 
But the rightmost non-zero digit of 3125! is not 5.

--Bruce Kaskel