print("模式A")
count_a=1
while count_a<=6:
for i in range(1,count_a+1):
print(i,end=" ")
if i==count_a:
print()
count_a+=1
print("模式B")
count_b=6
while count_b>=0:
for i in range(1,count_b+1):
print(i,end=" ")
if i==count_b:
print()
count_b-=1
print("模式C")
count_c=1
while count_c<=6:
for i in range(6, 0, -1):
if(i<=count_c):
print(i,end=" ")
else:
print(" ",end=" ")
print()
count_c+=1
print("模式D")
count_d=1
while count_d<=6:
for i in range(1,count_d):
print(" ",end=" ")
for i in range(1,8-count_d):
print(i,end=" ")
print()
count_d+=1
num = int(input("请输入一个三位整数:"))
if 100 <= num <= 999:
str_num = str(num)
if str_num == str_num[::-1]:
print("Yes")
else:
print("No")
else:
print("输入的数字不是三位整数")
def gys(x:int,y:int) -> int:
if x % y == 0:
return y
elif x % y == 1:
return 1
else:
return gys(y,x%y)
a,b=map(int,input("请输入两个数").split())
num=gys(a,b)
print(num)
def isprimefactor(num):
prime_factor=[]
i=2
while i<=num:
if num%i==0:
prime_factor.append(i)
num=num//i
else:
i+=1
return prime_factor
num=int(input("请输入一个正整数:"))
factors=isprimefactor(num)
print("素因子为:",factors)
def wqs(num):
factors=[]
for i in range(1, num):
if num%i == 0:
factors.append(i)
if sum(factors) == num:
return True
else:
return False
n=int(input())
if wqs(n):
print(n,"是完全数")
else:
print(n,"不是完全数")
count=0
for i in range(1,5):
for j in range(1,5):
for k in range(1,5):
if i!=j and i!=k and j!=k:
print(i,j,k)
count+=1
print("共有{}个三位数字".format(count))
def yi(n:int) -> int:
if n==1 or n==2:
return n
return yi(n-1)+yi(n-2)
n=int(input("请输入台阶数:"))
for i in range(1,n+1):
print(yi(i))
bin=input("请输入一个二进制:")
bin_list=[int(x) for x in str(bin)[::-1]]
dec=0
for i in range(len(bin_list)):
dec+=bin_list[i]*2**i
print("十进制:",str(dec))