以下是针对给定问题的Python解决方案:
(1) 处理列表x,增加10并计算均值:
x = list(range(1, 101))
# 修改列表,给每个元素增加10
x = [num + 10 for num in x]
print("修改后的列表x:", x)
# 计算x的均值
mean_x = sum(x) / len(x)
print("x的均值:", mean_x)
(2) 输出斐波那契数列第10项:
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2)
print("斐波那契数列第10项:", fibonacci(9))
(3) 二分查找:
def binary_search(arr, target):
low, high = 0, len(arr) - 1
while low <= high:
mid = (low + high) // 2
if arr[mid] == target:
return mid
elif arr[mid] < target:
low = mid + 1
else:
high = mid - 1
return -1
x = list(range(1, 101))
num = int(input("请输入一个整数:"))
index = binary_search(x, num)
if index != -1:
print("索引:", index)
else:
print("无此数")
(4) 找出1000以内的所有完数:
def get_factors(n):
factors = []
for i in range(1, n // 2 + 1):
if n % i == 0:
factors.append(i)
return factors
perfect_numbers = []
for i in range(2, 1001):
factors = get_factors(i)
if sum(factors) == i:
perfect_numbers.append((i, factors))
for num, factors in perfect_numbers:
print(f"{num}: {factors}")
温馨提示:答案为网友推荐,仅供参考