LeetCode: Factorial Trailing Zeroes

Reference algorithm from Wiki:  http://en.wikipedia.org/wiki/Trailing_zero

1 2 3 4 5 6 7 8 9 10 11 12 13

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