172.|172. Factorial Trailing Zeroes
Problem
【172.|172. Factorial Trailing Zeroes】Given an integer n, return the number of trailing zeroes in n!.
Example
Input: 3
Output: 0
Explanation: 3! = 6, no trailing zero.
Input: 5
Output: 1
Explanation: 5! = 120, one trailing zero.
Code
static int var = [](){
std::ios::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}();
class Solution {
public:
int trailingZeroes(int n) {
int res = 0;
while(n>=5){
n = n / 5;
res += n;
}
return res;
}
};
Result
文章图片
172. Factorial Trailing Zeroes.png
推荐阅读
- GET blob:https://172.0.0.1:80/194d39e8-7254-4fc8-b2d9-81109b8ccc94 net::ERR_ACCESS_DENIED 200 (OK)
- Pike裸金属部署
- lintcode|lintcode 172. Remove Element