libra-gyf

摘要： #求最大公约数def hcf(x,y): if x>y: s = y else: s=y for i in range(1,s+1): if y%i ==0 and x %i ==0: hcf =i return hcf x = int(input("输入一个数: ")) y = int(input 阅读全文

摘要： # # return (year % 4 == 0 and year % 100 != 0) or year % 400 == 0 # 判断是否为闰年 # def leap(n,m): # ret =[] # for i in range(n,m): # if (i % 4 ==0 and i %1 阅读全文

摘要： #任意质数 def zhishu(n): if n < 2: return False for i in range(2, n): if n % i == 0: return False return True for i in range(2, 101): if zhishu(i): print( 阅读全文