![](https://lstatic.shangxueba.com/jiandati/h5/images/m_q_title.png)
[单选题]
求两个数m和n的最大公约数 正确算法的伪代码是?
A.input m,n if m<n then swap m,n r="mod(m,n)" if r≠0 m="n" n="r" print>
B.input m,n if m<n then swap m,n r="mod(m,n)" while r≠0 do m="n" n="r" end print>
C.input m,n if m<n then swap m,n r="mod(m,n)" if r≠0 n="r" m="n" print>
D.input m,n if m<n then swap m,n r="mod(m,n)" while r≠0 do n="r" m="n" end print>
提问人:网友ljynet
发布时间:2022-01-07