# Step1:输入两个数,并确定较大较小数
num1 = int(input('请输入第一个数:'))
num2 = int(input('请输入第二个数:'))
large = int(num1 > num2) * num1 + int(num1 < num2) * num2
small = int(num1 > num2) * num2 + int(num1 < num2) * num1
# Step2:进行辗转相除
while small != 0:
large %= small
large, small = small, large
# Step3:输出结果
print('最大公因数:', large)
想求最小公倍数的话就是两数之积除以它们的最大公因数
解决一个经典的余数问题:一堆苹果分给a个人刚好差一个,分给b个人也刚好差一个,分给c个人也刚好差一个。请问至少有多少个苹果?
# Step1:题目信息录入
a = int(input('请输入第一群人的人数:'))
b = int(input('请输入第二群人的人数:'))
c = int(input('请输入第三群人的人数:'))
# Step2:求a,b的最小公倍数ab
large = int(a > b) * a + int(a < b) * b
small = int(a > b) * b + int(a < b) * a
while small != 0:
large %= small
large, small = small, large
ab = a * b // large
# Step3:求ab与c的最小公倍数abc并输出
large = int(ab > c) * ab + int(ab < c) * c
small = int(ab > c) * c + int(ab < c) * ab
while small != 0:
large %= small
large, small = small, large
abc = ab * c // large
print('[', a, ',', b, ',', c, ']', '=', abc, sep='')
# Step4:计算苹果数并输出
apple = abc - 1
print('苹果数:', abc, '-1=', apple, '(个)', sep='')
# Step5:作答
print('答:有', apple, '个苹果。', sep='')