#encoding=utf-8
"""
求两个正整数m和n的最大公约数
"""
def find_most_common_divisor(dataA,dataB):
commonDivisorList=[]
if dataA>=dataB:
for i in range(1,dataB):
if dataA%i==0 and dataB%i==0:
commonDivisorList.append(i)
return max(commonDivisorList)
else:
for i in range(1,dataA):
if dataA % i ==0 and dataB % i == 0:
commonDivisorList.append(i)
return max(commonDivisorList)
print(find_most_common_divisor(20,30))