码迷,mamicode.com
首页 > 其他好文 > 详细

EularProject 38:数字组合1-9分解为数字与1到n的乘积的和

时间:2015-07-30 13:37:00      阅读:134      评论:0      收藏:0      [点我收藏+]

标签:

Pandigital multiples
Problem 38
Take the number 192 and multiply it by each of 1, 2, and 3:

192 × 1 = 192
192 × 2 = 384
192 × 3 = 576
By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)

The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).

What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, … , n) where n > 1?

Answer:
932718654
Completed on Thu, 30 Jul 2015, 04:33

__author__ = ‘zhengyi‘

def IsPass(x):
    Nstr=str(x)
    k=1
    while len(Nstr)<9:
        k+=1
        Nstr+=str(k*x)
    if len(Nstr)>9:
        return None
    if len(set(Nstr))<9:
        return None
    if ‘0‘ in Nstr:
        return None
    else:
        return Nstr

result=‘‘
for i in range(10,pow(10,4)):
    temp=IsPass(i)
    if temp:
        result=temp

print(result)

版权声明:本文为博主原创文章,未经博主允许不得转载。

EularProject 38:数字组合1-9分解为数字与1到n的乘积的和

标签:

原文地址:http://blog.csdn.net/zhangzhengyi03539/article/details/47147589

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!