prime = []
yes = 1 # 1为对,0为错
for i in range(2, 1001):
yes = True
for j in range(2, i):
if i % j == 0:
yes = 0
break
if yes == 1:
prime.appnd(1)
for i in range(1, len(prime)):
if prime[i] - prime[i - 1] == 2:
print("(", prime[i - 1], end=',')
print(prime[i], end=" )\n")
a = float(input("a="))
b = float(input("b="))
c = float(input("c="))
def area(side11, side22, side33):
p = (side11 + side22 + side33) / 2
s = (p * (p - side11) * (p - side22) * (p - side33)) ** (1 / 2)
print(f"三角形面积为{s}")
def isvalid(side1, side2, side3):
if side1 + side2 > side3 and side1 + side3 > side2 and side3 + side2 > side1:
area(side1, side2, side3)
else:
print("输入无效")
isvalid(a, b, c)
print(s)
def reverse(number):
x = str(number)
b = x[::-1]
print(x, b)
return b
def ispalimdrome(number1):
if reverse(number1) != str(number1):
print("不是回文数")
else:
print(f"{number1}这个数是回文数")
a = int(input("请输入一个整数"))
ispalimdrome(a)
这段代码首先生成1到1000之间的素数列表,然后找出相差为2的素数对。接着,它接收用户输入的三边长来判断是否能构成有效三角形并计算其面积。最后,程序接收一个整数,检查它是否为回文数。
1029





