没人会做

用辗转相除法

按顺序,两归一,两归一,完成.

我不会

有十个数要求最大公约数:
a1, a2, a3, a4, a5, a6, a7, a8, a9, a10
  \  /  /  /
   \/  /  /
   b1 /  /
    \/  /
    b2 /
     \/
    先求其中两个数的最大公约数
    再以结果与其他数求最大公约数
    所有值都参加过计算得出来的最大公约数就是了
    这都已经是小学时候的问题了

CLS
DECLARE FUNCTION yunsuan! ()
DIM SHARED a(1 TO 100) AS INTEGER
DIM SHARED i AS INTEGER
DIM SHARED n AS INTEGER
FOR i = 1 TO 100
   PRINT "a("; i; ")=";
   INPUT a(i)
   IF a(i) = 0 THEN n = i - 1: EXIT FOR
NEXT i
FOR i = 2 TO n
   a(i) = yunsuan
NEXT i
PRINT a(n)
END

FUNCTION yunsuan
DIM x AS INTEGER
DIM y AS INTEGER
DIM r AS INTEGER
x = a(i): y = a(i - 1)
IF x < y THEN SWAP x, y
r = x MOD y
DO WHILE r <> 0
   x = y: y = r
   r = x MOD y
LOOP
yunsuan = y
END FUNCTION

print "输入结束后直接回车计算结果"
do
  if j&=0 then j&=i&
  j&= fun最大公约数& (i&,j&)
  input "请输入:",i&
loop while i&  
  print "它们的最大公约数为";j&

用辗转相减法

cls
read m,n
do while n<>-1
  do
    r=m mod n
    m=n
    n=r
  loop until r=0
  read n
loop
print m
data 自行输入