leetcode:Factorial Trailing Zeroes

注意越界！

class Solution {
public:
    int trailingZeroes(int n) {
        int sum = 0;
        long long i =5;
        while(i<=n)
        {
            sum += n/i;
            i *= 5;
        }
        return sum;
    }
};