Factorial Trailing Zeroes LeetCode solution in C++

1
class Solution {
2
 public:
3
  int trailingZeroes(int n) {
4
    int ni = 0, mi = 0;
5
    for (int i = 1; i <= n; i++) {
6
      int x = i;
7
      while (x % 2 == 0) {
8
        x = x >> 1;
9
        ni++;
10
      }
11
      while (x % 5 == 0) {
12
        x = x / 5;
13
        mi++;
14
      }
15
    }
16
    return min(mi, ni);
17
  }
18
};