gcd
  1. # your code goes here
  2. def gcd(m, n):
  3.         r = m%n
  4.         while r!=0:
  5.                 m = n
  6.                 n = r
  7.                 r = m%n
  8.         return n
  9.        
  10.  
  11.  
  12. print(gcd(12,30))
Parsed in 0.001 seconds