n的阶乘程序python_Python程序对N阶乘的尾随零进行计数

n的阶乘程序python

Formula used:

使用的公式:

Trailing 0s in N! = Count of 5s in prime factors of n!
    = floor(n/5) + floor(n/25) + floor(n/125) + ....

Example:

例:

    Input: N = 23
    Output: 4
    Factorial of 23 is 25852016738884976640000 which has four trailing 0.

    Input: N = 25
    Output: 6
    Factorial of 25 is 15511210043330985984000000 which has six trailing 0.

Code:

码:

# Define a function for finding
# number of trailing zeros in N!
def find_trailing_zeros(num) :
    sum = 0
    i = 1
    
    # iterating untill quotient is not zero
    while(True) :

        # take integer divison 
        quotient = num // (5 ** i)
        
        if(quotient == 0) :
            break
        
        sum += quotient
        i += 1
    
    return(sum)
	
# Driver code    
if __name__ == "__main__" :
    
    # assigning a number
    num = 10
    
    # function call
    print("Number of trailing zeros in factorial of",num,"is :",find_trailing_zeros(num))
    
    num = 20
    
    print("Number of trailing zeros in factorial of",num,"is :",find_trailing_zeros(num))

Output

输出量

Number of trailing zeros in factorial of 10 is : 2
Number of trailing zeros in factorial of 20 is : 4


翻译自: https://www.includehelp.com/python/count-number-of-trailing-zeros-in-factorial-of-number-n.aspx

n的阶乘程序python

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值