Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
class Solution {
public:
int trailingZeroes(int n)
{
long res = 0, mul = 5;
while(mul <= n)
{
res += (n/mul);
mul *= 5;
}
return res;
}
};