尾部的零

尾部的零

描述
设计一个算法，计算出n阶乘中尾部零的个数

样例
样例 1:
输入: 11
输出: 2

样例解释: 
11! = 39916800, 结尾的0有2个。

样例 2:
输入: 5
输出: 1

样例解释: 
5! = 120， 结尾的0有1个。

挑战
O(logN)的时间复杂度

方法一：

#include<iostream>
#include<cmath>
using namespace std;

class Solution {
public:
    /*
     * @param n: A long integer
     * @return: An integer, denote the number of trailing zeros in n!
     */
    long long trailingZeros(long long n) {
        // write your code here, try to do it without arithmetic operators.
        long long sum=0;
        while(n!=0){
            n = n/5;
            sum += n;
        }
        return sum;
    }
};

int main()
{
	Solution A;
	cout<<A.trailingZeros(29191991000000000);
	return 0;
}

方法二：

#include<iostream>
#include<cmath>
using namespace std;

class Solution {
public:
    /*
     * @param n: A long integer
     * @return: An integer, denote the number of trailing zeros in n!
     */
    long long trailingZeros(long long n) {
    	int i;
    	long long sum=0;
    	int power=log10(n)/log10(5);
    	cout<<power;
    	for(i=1;i<=power;i++){
    		sum += n/pow(5,i);
		}
		return sum;
    }
};

int main()
{
	Solution A;
	cout<<A.trailingZeros(29191991000000000);
	return 0;
}