1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
| int somme = 13;
int[] tab = new int[] {5, 8, 13, 2, 3, 9, 4};
Model m = new CPModel();
Solver s = new CPSolver();
IntegerVariable[] res = Choco.makeIntVarArray("res", 3, tab);
//m.addConstraint(Choco.allDifferent(res));
m.addConstraint(Choco.eq(somme, Choco.sum(res)));
s.read(m);
s.solve();
if (s.isFeasible())
{
int cpt =1;
do
{
System.out.print((cpt++)+ " - "+ somme+" = " + s.getVar(res[0]).getVal());
for (int i = 1; i < res.length; i++)
{
System.out.print(" + " + s.getVar(res[i]).getVal());
}
System.out.println();
}
while (s.nextSolution()!=false);
} else
System.err.println("Pas de solutions"); |