In [48]:
def sum():
n = int(input('请输入一个整数,以回车结束。'))
num = 1
for i in range(n):
num *= (i + 1)
print(num)
sum()
In [51]:
def sum():
numbers = []
n = int(input('请输入一个整数,表示将要输入的数字个数,回车结束。'))
for i in range(n):
number = float(input('请输入一个数字,回车结束。'))
numbers.append(number)
total = 0.0
for number in numbers:
total += number
print('所有数字的和为:',total)
sum()
In [52]:
def min():
numbers = []
n = int(input('请输入一个整数,表示将要输入的单词数,回车结束。'))
for i in range(n):
number = float(input('请输入一个数字,回车结束。'))
numbers.append(number)
min = numbers[0]
for number in numbers:
if number < min:
min = number
print('所有数字的最小值为:',min)
min()
In [55]:
def search():
numbers = []
n = int(input('请输入一个整数,表示将要输入的数字个数,回车结束。'))
for i in range(n):
number = int(input('请输入一个数字,回车结束。'))
numbers.append(number)
num = float(input('请输入要搜索的数字,回车结束。'))
for i in range(n):
if numbers[i] == num:
print(i)
break
else:
print(-1)
search()
In [7]:
import math
def cos(vectors1, vectors2):
up = vectors1[0] * vectors2[0] + vectors1[1] * vectors2[1]
down = math.sqrt(vectors1[0] ** 2 + vectors1[1] ** 2) * math.sqrt(vectors2[0] ** 2 + vectors2[1] ** 2)
return up / down
vectors1 = []
for i in range(2):
vector = int(input('请输入一个数字作为向量1,回车结束。'))
vectors1.append(vector)
vectors2 = []
for i in range(2):
vector = int(input('请输入一个数字作为向量2,回车结束。'))
vectors2.append(vector)
cos(vectors1, vectors2)
Out[7]:
In [10]:
way = 0
for i in range(5,90):
for j in range(5,90):
for k in range(5,90):
if i + j + k == 100:
way += 1
print(way)