Программа 28 c. 135 Кирсанов М.Н. Графы в Maple Физматлит 2007
Задача о назначениях
| > | #Программа 28 В.А.Александров (простой перебор) |
| > | restart: n:=4: |
| > | A:=[[1,7,1,3],[1,6,4,6],[17,1,5,1],[1,6,10,4]]; |
A := [[1, 7, 1, 3], [1, 6, 4, 6], [17, 1, 5, 1], [1, 6, 10, 4]]
| > | w:=0: |
| > | for i1 to n do |
| > | for i2 to n do |
| > | for i3 to n do |
| > | for i4 to n do |
| > | if i1<>i2 and i1<>i3 and i1<>i4 |
| > | and i2<>i3 and i2<>i4 and i3<>i4 |
| > | then w:=w+1; |
| > | S[w]:=add(A[i||k,k],k=1..n); |
| > | fi; |
| > | od; |
| > | od; |
| > | od; |
| > | od; |
| > | MinSum:=min(seq(S[i],i=1..w)); |
MinSum := 7