用Python实现求最大公约数和判断是否是素数

程序如下:

#!/usr/bin/env python

def showMaxFactor(num):
    count = num / 2 
    while count > 1:
        if num % count == 0:
            print 'largest factor of %d is %d' % (num, count)
            break        #break跳出时会跳出下面的else语句
        count -= 1
    else:
        print num, "is prime"

for eachNum in range(10,21):
    showMaxFactor(eachNum)

输出如下:

largest factor of 10 is 5
11 is prime
largest factor of 12 is 6
13 is prime
largest factor of 14 is 7
largest factor of 15 is 5
largest factor of 16 is 8
17 is prime
largest factor of 18 is 9
19 is prime
largest factor of 20 is 10


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值