QB真是古董级的东西啦下面是递归的方法：主程序：DECLARE FUNCTION test (x AS INTEGER)CLEAR ,,2000'增加栈空间，就不会出现堆栈溢出了。PRINT test(100)函数定义FUNCTION test (x AS INTEGER)IF x = 1 THEN
test = 1ELSE
test = test(x - 1) + xEND IFEND FUNCTION递推的：主程序：DIM i AS INTEGERDIM sum AS INTEGERFOR i = 1 TO 100sum = sum + iNEXTPRINT sum
