- #/usr/bin/env python
- '''欧拉计划005,求1~20的最小公倍数。
- 可以算不同n数值的最小公倍数,但是n要大于等于3
- '''
-
-
- def Ghost_Euler_005(n=20):
- multiple = 2
- for i in range(2,n):
- multiple = gongbeishu(multiple,i+1)
- print(multiple)
-
- def gongbeishu(m,n):
- divisor = gongyueshu(m,n)
- return(m*n / divisor)
-
- def gongyueshu(a,b):
- min = divisor = 0
- if a>b:
- min = b
- else:
- min = a
- for i in range(1,min+1):
- if a%i == 0 and b%i == 0:
- divisor = i;
- return(divisor)
-
复制代码
|