最大公约数

最大公约数

辗转相除法，俩个整数a和b, a%b = c
a,b最大公约数就等于 b，c最大公约数

奇偶数判断

(a&1) == 0 a是偶数
(a&1) !=0 a是奇数

def get_largest_common2(a, b):
	big = max(a, b)
	small = min(a, b)	
	if big % small == 0:
		i += 1
		return small
	return get_largest_common2(big % small, small)

print(get_largest_common2(100,45))


# 更相减损术

def get_largest_common3(a, b):
	if a == b:
		return a
	big = max(a, b)
	small = min(a, b)
	return get_largest_common3(big - small, small) 
	
print(get_largest_common3(100,45))



# 暴力列举
def get_largest_common(a, b):
	big = max(a, b)
	small = min(a, b)
	if big % small == 0:
		return small
	for i in range(small // 2, 1, -1):
		# print(i)
		if small % i == 0 and big % i == 0:
			return i

	return 1

# print(get_largest_common(102,101))