常见功能代码 

 1 #!/usr/bin/env python
 2 # 求素数
 3 import math
 4 def getPrimes(num):
 5     result = []
 6     if num == 2:
 7         result.append(num)
 8     for i in range(2,num):
 9         for j in range(2,int(math.sqrt(i))+1):
10             if i % j == 0:
11                 break
12         else:
13             result.append(i)
14     return result
15 
16 print(getPrimes(12))

1 #!/usr/bin/env python
2 # 求最大公约数
3 def gcd(m,n):
4     if n == 0:
5         return m
6     return gcd(n,m%n)
7 
8 print(gcd(36,24))

 

1 #!/usr/bin/env python
2 # 求阶乘
3 def fac(num):
4     if num == 1:
5         return 1
6     return num*fac(num-1)
7 
8 print(fac(2))

 

 1 #!/usr/bin/env python
 2 # 求最小公倍数
 3 def lcm(m,n):
 4     max = m if m > n else n
 5     while True:
 6         if max % m == 0 and max % n == 0:
 7             return max
 8         max += 1
 9 
10 print(lcm(2,5))

 

 

posted @ 2020-08-20 23:43  清风与我_PY  阅读(155)  评论(0)    收藏  举报