ユークリッドの互除法

最大公約数を求める。

#! usr/bin/env python
# -*- coding: utf-8 -*-

#euclidian1.py

m = int(raw_input("Set m : "))
n = int(raw_input("Set n : "))

while m != n:
    if m >= n:
        m = m-n
    else: 
        n = n-m
print "GCC = ",m

n>nの時有効。

#! usr/bin/env python
# -*- coding: utf-8 -*-

#euclidian2.py

m = int(raw_input("Set m : "))
n = int(raw_input("Set n : "))
k = m % n 
while k != 0:
    k = m % n 
    m = n
    n = k
print "GCC = ",m