Greatest common divisor using the Euclidian Algorithm

gcd.py

import sys,math
a = float(sys.argv[1])
b = float(sys.argv[2])
remainder = 1.0
if a<b:
	a=b
	b=float(sys.argv[1])
c = a/b
while(round(remainder,2)!=0):
	q=math.floor(c+.000001)
	remainder=c-q
	a=b
	b=remainder*b
	if b!=0:
		c=a/b
	#print c,a,b,q,remainder
print int(round(a))