用vfp编程求整数M和N的最大公约数

input "m=" to m
input "n=" to n
for i=min(m,n) to 1 step -1
if m%i=0 and n%i=0
exit
endif
endfor
?"这两个数的最大公约数是：",i
?"这两个数的最小公倍数是：",m*n/i

do while .t.
input "m=" to m
if int(m)=m
exit
endif
enddo

do while .t.
input "n=" to n
if int(n)=n
exit
endif
enddo

if abs(m)>abs(n)
p=abs(n)
else
p=abs(m)
endif

for i=p to 1 step -1
if mod(m,i)=0 and mod(n,i)=0
? "m,n的最大公约数：",i
exit
endif
endfor
return