欧拉计划第52题的Python的实现

最新推荐文章于 2024-09-14 19:55:48 发布

梦酒

最新推荐文章于 2024-09-14 19:55:48 发布

阅读量281

点赞数

分类专栏： LintCode 文章标签： python 欧拉计划

本文链接：https://blog.csdn.net/u012254404/article/details/41833483

版权

LintCode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

import time
def judge(number):
    return len(str(int(float(number))))
def check(number1,number2):
    if judge(number1) == judge(number2):
        for i in range(0,len(str(number1))):
            if str(number1)[i] in str(number2):
                i = i+1
            else:
                return False
    else:
        return False
    return True
start = time.time()
num = 120008
while (num <= 10000000):
    if check(num,2*num) == True and check(num,3*num) == True and check(num,4*num) == True and check(num,5*num) == True and check(num,6*num) == True:
        print num
        break;
    num = num + 1
print str(round(time.time()-start,3))+'s'