forth/school/greatest_common_divisor.fth · 59 字节 · 下载原文
: gcd ( a b -- n ) begin dup while tuck mod repeat drop ;