Python基础训练100题-2

# 递归实现
def Fib(n):
    return 1 if n<=2 else Fib(n-1)+Fib(n-2)
print(Fib(int(input())))
    
# 朴素实现
target=int(input())
res=0
a,b=1,1
for i in range(target-1):
    a,b=b,a+b
print(a)

import copy
a = [1,2,3,4,['a','b']]
 
b = a# 赋值
c = a[:]# 浅拷贝
d = copy.copy(a)# 浅拷贝
e = copy.deepcopy(a)# 深拷贝
 
a.append(5)
a[4].append('c')
 
print('a=',a)
print('b=',b)
print('c=',c)
print('d=',d)
print('e=',e)

for i in range(1,10):
    for j in range(1,i+1):
        print('%d*%d=%2ld '%(i,j,i*j),end='')
    print()

import time
for i in range(4):
    print(str(int(time.time()))[-2:])
    time.sleep(1)

import time
 
for i in range(4):
    print(time.strftime('%Y-%m-%d %H:%M:%S',time.localtime(time.time())))
    time.sleep(1)