搜索与回溯算法(第二十五课).pptVIP

【参考程序】 program ex5_7; type five=1..5; const like:array[five,five] of 0..1=((0,0,1,1,0),(1,1,0,0,1),(0,1,1,0,0), (0,0,0,1,0),(0,1,0,0,1)); name:array[five] of string[6]=(zhang,wang,liu,sun,li); var book:array[1..5] of 0..5; flag:set of five; c:integer; procedure print; var i:integer; begin inc(c);writeln(answer,c,:); //方案数累加1 for i:=1 to 5 do writeln(name[i]:10,:,chr(64+book[i])); //输出分书的方案 end; procedure Search(i:integer);