第一题
In [18]:
def Equilateral(a,b):
for m in range(1,b+1):
print((b-m)*' '+m*(a+' '))
symbol = input('请输入符号:')
side = int(input('请输入行数:'))
Equilateral(symbol,side)
第二题
In [19]:
for i in range(1,10):
for j in range(1,i+1):
print(j,"*",i,"=",i*j," ",'\t',end="")
print(end='\n')
第三题
In [25]:
import math
def getprimes(n):
p=2
x=0
list=[]
while(x<n):
result=True
for i in range(2,p_1):
if(p%i==0):
result=False
if result==True:
list.append(p)
return list
def judge(a):
for m in range(1,100000):
for n in range(1,100000):
if a=m+n and m in the list and n in the list and:
print(m,n)
number=int(input("请输入需要判断的整数:"))
getprimes(100000)
judge(number)
第四题
In [ ]:
list=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]
n=20