Problem 4:Largest palindrome product


题:A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 ×99.

Find the largest palindrome made from the product of two 3-digit numbers.


代码:

def fun1(num):
    for arr in str(num).split():
        for i in range(len(arr)):
            if(arr[i]!=arr[len(arr)-1-i]):
                return False
    return True
    
def fun2(num):    
    for i in range(100,1000):
        if(num%i==0 and num/i>=100 and num/i<1000):
            return True
    return False
            
for num in range(1000000,10000,-1):
    if(fun1(num)):
        if(fun2(num)):
            print num
            break


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值