Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
18 lines
711 B
MiniZinc
18 lines
711 B
MiniZinc
% 布尔型变量 x的总和 = s
|
|
predicate bool_sum_eq(array[int] of var bool:x, int:s) =
|
|
let { int: c = length(x) } in
|
|
if s < 0 then false
|
|
elseif s == 0 then forall(i in 1..c)(x[i] == false)
|
|
elseif s < c then
|
|
let { % cp = nearest power of 2 >= c
|
|
int: cp = pow(2,ceil(log2(int2float(c)))),
|
|
array[1..cp] of var bool:y, % y is padded version of x
|
|
array[1..cp] of var bool:z } in
|
|
forall(i in 1..c)(y[i] == x[i]) /\
|
|
forall(i in c+1..cp)(y[i] == false) /\
|
|
oesort(y, z) /\ z[s] == true /\ z[s+1] == false
|
|
elseif s == c then forall(i in 1..c)(x[i] == true)
|
|
else false endif;
|
|
|
|
include "oesort.mzn";
|