Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def gcd(m,n):
- l = []
- for i in range (1,m+1):
- if (m%i) == 0 :
- l.append(i)
- p = []
- for j in range (1,n+1):
- if (n%j) == 0 :
- p.append(j)
- k = []
- for h in l :
- if h in p :
- k.append(h)
- return (k[-1])
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement