斐波那契数列

def fibonacci(n): if n == 0: return 0 elif n == 1: return 1 else: return fibonacci(n-1) + fibonacci(n-2)

for i in range(0, 101): if fibonacci(i) > 100: break print(fibonacci(i))

素数和素数之和

primes = [] sum_primes = 0

for num in range(2, 101): for i in range(2, num): if num % i == 0: break else: primes.append(num) sum_primes += num

print('素数：', primes) print('素数之和：', sum_primes)