def gcd(a, c): while c != 0: a, c = c, a % c return a a, c = map(int, input("请输入两个整数a和c，用空格分隔：").split()) print(f"{a}和{c}的最大公约数是：{gcd(a, c)}")