题解 | 阶乘尾零

#include <cmath>
class Factor {
public:
    int getFactorSuffixZero(int n) {
        // write code here
        int count = log(n)/log(5);
        int res =0;
        for (int i=1; i<=count; ++i) {
            res+= n/pow(5,i);
        }
        return res;
    }
};