input"輸入M:" to m
input"輸入N" to n
a=m
b=n
if n=0 then
  ?"數(shù)據(jù)有錯(cuò)！"
  exit
endif  
 r=mod(m,n)
do while r>0
  m=n
  n=r
  r=mod(m,n)
enddo
?"最大公約數(shù)是：",n
?"最小公倍數(shù)是：",a*b/n