【发布时间】:2018-12-13 14:13:46
【问题描述】:
我最近在研究一些项目的欧拉问题
最小倍数
问题 5
2520 是可以除以 1 到 10 的每个数字而没有余数的最小数字。
能被 1 到 20 的所有数整除的最小正数是多少?
我写的代码很好用
def factor_finder(n, j=2):
factor_list = []
if n == 2:
return [2]
elif n == 3:
return [3]
else:
while n >= j * 2:
while n % j == 0:
n = int(n / j)
factor_list.append(j)
j += 1
if n > 1:
factor_list.append(n)
return factor_list
def smallest_multiples(n):
from functools import reduce
factor_list = []
final_list = []
for i in range(2, n + 1):
factor_list += factor_finder(i)
# print(factor_list)
for i in set(factor_list):
l1 = []
l2 = []
for j in factor_list:
if j == i:
l1.append(j)
else:
if len(l1) > len(l2):
l2 = l1
l1 = []
else:
l1 = []
# print(l2)
final_list += l2
# print(final_list)
return (
np.array(final_list).cumprod()[-1],
reduce((lambda x, y: x * y), final_list),
)
结果是:
%时间
smallest_multiples(1000)
CPU 时间:用户 5 µs,系统:0 ns,总计:5 µs 挂壁时间:32.4 µs
(-4008056434385126912, 7128865274665093053166384155714272920668358861885893040452001991154324087581111499476444151913871586911717817019575256512980264067621009251465871004305131072686268143200196609974862745937188343705015434452523739745298963145674982128236956232823794011068809262317708861979540791247754558049326475737829923352751796735248042463638051137034331214781746850878453485678021888075373249921995672056932029099390891687487672697950931603520000)
我的问题是为什么 numpy.cumprod() 未能获得正确的数字。我认为 numpy 是非常数字工具。有人可以给我一些想法吗?
【问题讨论】:
标签: python numpy biginteger