PYTHON常见练习

n=int(input("请输入整数"))
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(1,n+1):
            for m in range(1,n+1):
                for n in range(1,n+1):
                    num=int(str(i)+str(j)+str(k)+str(m)+str(n))
                    if num%2==0:
                        print(num)


# 计算杨辉三角 定义法
n = eval(input("输入要打印的行数："))
triangle = [[1], [1, 1]]
for i in range(2, n):  # 已经给出前两行，求剩余行
    pre = triangle[i-1]  # 上一行
    cul = [1]  # 定义每行第一个元素
    for j in range(i-1):  # 算几次
        cul.append(pre[j]+pre[j+1])  # 每个数字等于上一行的左右两个数字之和。
    cul.append(1)  # 添加每行最后一个元素
    triangle.append(cul)
print("普通输出:{}".format(triangle))
for i in range(n):  # 按等边三角形格式输出
    s = " "*(n-i-1)
    for j in triangle[i]:
        s = s + str(j)+" "
        print(s)
    print(s)


n = int(input())
total_list = [[1], [1, 1]]
for i in range(2, n):
    firs_t = [1]
    pre_list = total_list[i-1]
    for j in range(1, i):
        cul_list = pre_list[j] + pre_list[j-1]
        firs_t.append(cul_list)
    firs_t.append(1)
    total_list.append(firs_t)
print("{}".format(total_list))
#
for i in range(n):  # 按等边三角形格式输出
    s = " "*(n-i-1)
    for j in total_list[i]:
        s = s + str(j)+" "
    print(s)


def fibonacci(n):
    a, b, counter = 0, 1, 0
    while counter < n:
        pre = b
        las = pre+b
        counter = counter + 1
fibonacci(5)
#
#
#
import sys
n = int(input(n))
list_n = [0, 1]
a1 = 0
a2 = 1
counter = 2
while counter < n:
    a_n = a1+a2
    a1 = a2
    a2 = a_n
    counter += 1
    list_n.append(a_n)
print(list_n)