6.1
Code:
n = int(input(''))
def fbnq(n):
pre = 1
res = 0
temp = 0
i = 0
while i < n:
temp = res
res = res + pre
pre = temp
i += 1
return res
print(fbnq(n))
6.2
Code:
num1 = int(input(''))
num2 = int(input(''))
def hcf(num1,num2):
num3 = min(num1, num2)
list = []
for i in range(1,num3+1):
if num1 % i == 0 and num2 % i == 0:
list.append(i)
num = max(list)
return num
print(hcf(num1,num2))