N!

N!

Time Limit: 1000ms   Memory limit: 65536K  有疑問？點這裏^_^

題目描述

首先很感謝劉老師能給我這次機會給大家出題，希望大家做完題後能有所收穫，如果有任何問題還請海涵，畢竟出套題不容易……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

提示

 

來源

 HDU shadow95

示例程序

view plaincopyprint如果您複製代碼時出現行號，請點擊左邊的“view plain”後再複製

#include<stdio.h>
#include<string.h>

int fun(int n)
{
    int sum=0;
    while(n)
    {
        n=n/5;
        sum+=n;
    }
    return sum;
}

int main()
{
    int t, T, n;
    scanf("%d", &T);
    for(int t=1;t<=T;t++)
    {
        scanf("%d", &n);
        int re=fun(n);
        printf("Case #%d: %d\n", t, re);
    }
    return 0;
}