二级程序 

1 def fib(n):
2     a,b = 1,1
3     for i in range(n-1):
4         a,b = b,a+b
5     return a
6 print (fib(7))

菲斯波尔序列

1 def fact(n):
2     if n==0:
3         return 1
4     else:
5         return n*fact(n-1)
6 num =eval(input("请输入一个整数："))
7 print(fact(abs(int(num))))

数的阶乘

 1 def GreatCommonDivisor(a,b):
 2     if a > b:
 3         a,b = b,a
 4     r = 1
 5     while r != 0:
 6         r=a%b
 7         a = b
 8         b = r
 9     return a
10 m = eval(input())
11 n = eval(input())
12 print(GreatCommonDivisor(m,n))

最大公约数

 

posted @ 2019-03-28 17:18  PDAE  阅读(166)  评论(0)    收藏  举报