N! SDUT 3138

题目描述

首先很感谢刘老师能给我这次机会给大家出题，希望大家做完题后能有所收获，如果有任何问题还请海涵，毕竟出套题不容易……TAT
题目整体不难，大体是给我带的大一新生出题的难度，所以请各位放心。
If you want to learn something from other people, remember, stay hunger.---shadow95
Now, your first problem comes~
This task is very simple, please calculate how many zeros are there at the end of calculation of n!.
For example, 15! = 1307674368000, so answer is 3.

输入

 At the first line, there is a number T indicating the number of test cases.
Then, following T lines, each line there is a number n (n<10^9).

输出

For each case, output the case number and answer in one line.

示例输入

3
5
100
1024

示例输出

Case #1: 1
Case #2: 24
Case #3: 253

找规律,醉了吧,一直除5.

<pre name="code" class="cpp">#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>

using namespace std;

int main()
{
    int n,t;
    cin>>t;
    for(int i=1; i<=t; i++)
    {
        cin>>n;
        int k=0;
        while(n!=0)
        {
            k+=n/5;
            n=n/5;
        }
        cout<<"Case #"<<i<<": "<<k<<endl;

    }
    return 0;
}