![]() ![]() |
|
八皇后问题的Qbasic版的解决方案 | |
作者:佚名 文章来源:不详 点击数 更新时间:2007/12/21 18:18:06 文章录入:杜斌 责任编辑:杜斌 | |
|
|
20 a(i) = 1 30 g = 1 40 for k = i - 1 to 1 step -1 50 if a(i) = a(k) then 70 60 if abs(a(i) - a(k)) <> i - k then 90 70 g = 0 80 goto 100 90 next k 100 if i <> 8 then 180 110 if g = 0 then 180 120 for l = 1 to 8 130 print using “##”; a(l); 140 next l 150 print “*”; 160 m = m + 1 170 if m mod 3 = 0 then print 180 if g = 0 then 230 190 if i = 8 then 230 200 i = i + 1 210 a(i) = 1 220 goto 30 230 if a(i) < 8 then 270 240 i = i - 1 250 if i = 0 then 290 260 goto 230 270 a(i) = a(i) + 1 280 goto 30 290 print 300 print “sum=”; using “##”; m; 310 print 320 end |
|
![]() ![]() |