python
题目描述
输入两个整数,判断它们是否互质。
输入
输入两个整数a,b,每行一个。
输出
输出它们是否互质,如果互质的话,则输出:a and b are coprime,否则输出: a and b are not coprime。
样例输入
2
3
样例输出
2 and 3 are coprime
使用辗转相除法求
def gcd(a,b):
n,m = a,b
if a > b:
a,b = b,a
while a > 0:
a,b = b%a,a
if b != 1:
print(f"{n} and {m} are not conprime")
return
print(f"{n} and {m} are conprime")
n = int(input())
m = int(input())
gcd(n,m)
辗转相除,看最大公因数是否等于1
def gcd(m, n):
return n if (m == 0) else gcd(n % m, m)
if __name__ == '__main__':
m, n = map(int, input().split())
print("%s\n", "{} and {} are coprime".format(m, n) if (gcd(m, n) == 1) else "{} and {} are not coprime".format(m, n))