Homework from 20/10/14

#get the remainder when you devide a by b i.e a%b
def get_remainder(a,b):
        i = 0
        while a - i*b >=0:
                i+=1
        return abs(a-(i-1)*b)
#greatest common devider
def GCD(m,n):
        for i in xrange(0,10):
                if m<n:
                        temp = m
                        m = n
                        n = temp
                #m devided by n let r be the remainder
                r= get_remainder(m,n)
                if r == 0:
                        return n
                m = n
                n = r

def get_number():
        number = int(raw_input("Please enter one number."))
        return number

def main():
        m = get_number()
        n = get_number()
        print GCD(m,n)
main()