分类
标签
315417911
PythonTip >> 博文 >> 解题报告
DaysOfMonth = [0,31,28,31,30,31,30,31,31 ...
year = int(year)
if (year%4 == 0 and year%100 ...
if (year%4 == 0 and year%100 ...
stime = st.split(':')
etime = et.split(':')
hour,minute,seconde = int ...
etime = et.split(':')
hour,minute,seconde = int ...
def isHwzc(a):
return (True if a == a[::-1] else ...
return (True if a == a[::-1] else ...
ans = []
for i in a:
num = ord(i)
num += b ...
for i in a:
num = ord(i)
num += b ...
print ("LOVE" if "love" in a.lower() else "SINGLE" )
def getMinimumCommonDivisor(a,b):
if (a < b):
return getMinimumCommonDivisor(b ...
def findLongestMirror(L):
longestI = -1;
longestJ = -1;
longest = 0;
lenL ...
主要思想就是
F(N) = (N /1) * (1**2) + (N /2 ) * (2 ...
实际上是求最大公约数因子的个数
import math
def gcd(a,b):if b==0 ...