defgcd(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))
ShaNgZ1的博客/usr/dev/python #-*- coding:utf-8 -*- ''' Extended Euclidean algorithm(a,b) code by ShaNgZ algorithm from <cryptography theory and pratice,third editon> 2019_01_...