0811 coprime test
ph
#coprime test def gcd(a,b): [n, m] = sorted([a,b]) q = m%n if q ==0: return n else: return gcd(n, q) def iscoprime(a,b): return gcd(a,b) == 1
#coprime test def gcd(a,b): [n, m] = sorted([a,b]) q = m%n if q ==0: return n else: return gcd(n, q) def iscoprime(a,b): return gcd(a,b) == 1