摘要： from math import sqrt def huiwen(num): temp=num total=0 while temp>0: total=total * 10+temp % 10 temp//=10 if num==total: return num def prime(num): f 阅读全文

摘要： year=input()month=input()day=input()days = int(day)_30_month = {4, 6, 9, 11}_31_month = {1, 3, 5, 7, 8, 10, 12}if (int(year)%4==0 and int(year)%100!=0 阅读全文