Given a positive integer n, compute the number n! tail 0. Input: Input data have a number of lines. Each line has a positive integer n, corresponding to a situation. Output: For each case, the first output " Case#:" (# is the serial number, starting from 1), and then output the value of n, a comma, the result, change the line.

97_阶乘尾部0的个数
..................\97.cpp
..................\97.msp
..................\Debug
..................\.....\97.exe
..................\.....\97.o

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．