小狼的窝

1.辗转相除法求最大公约数(greatest common divisor)gcd:算法：Loop. Loop until p = q. Swap. If p q then subtract q from p, p ← p − q. Result. Print p 代码：#!/usr/bin/env python def gcd(p, q): while p != q: if p