2018-02-19 15:21:05 +01:00
|
|
|
// Copyright 2011 Hakan Kjellerstrand hakank@gmail.com
|
2011-03-21 18:40:46 +00:00
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
|
//
|
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
|
//
|
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
|
// limitations under the License.
|
2020-06-10 14:36:44 +02:00
|
|
|
package com.google.ortools.contrib;
|
|
|
|
|
|
2020-09-11 21:17:23 +02:00
|
|
|
import com.google.ortools.Loader;
|
2018-10-31 16:18:18 +01:00
|
|
|
import com.google.ortools.constraintsolver.*;
|
2011-03-21 18:40:46 +00:00
|
|
|
import com.google.ortools.constraintsolver.DecisionBuilder;
|
|
|
|
|
import com.google.ortools.constraintsolver.IntVar;
|
|
|
|
|
import com.google.ortools.constraintsolver.Solver;
|
2018-10-31 16:18:18 +01:00
|
|
|
import java.io.*;
|
|
|
|
|
import java.text.*;
|
|
|
|
|
import java.util.*;
|
2011-03-21 18:40:46 +00:00
|
|
|
|
|
|
|
|
public class Xkcd {
|
2018-10-31 16:18:18 +01:00
|
|
|
/** Solves the xkcd problem. See http://www.hakank.org/google_or_tools/xkcd.py */
|
2011-03-21 18:40:46 +00:00
|
|
|
private static void solve() {
|
|
|
|
|
Solver solver = new Solver("Xkcd");
|
|
|
|
|
|
|
|
|
|
int n = 6;
|
|
|
|
|
// for price and total: multiplied by 100 to be able to use integers
|
2018-10-31 16:18:18 +01:00
|
|
|
int[] price = {215, 275, 335, 355, 420, 580};
|
2011-03-21 18:40:46 +00:00
|
|
|
int total = 1505;
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Variables
|
|
|
|
|
//
|
|
|
|
|
IntVar[] x = solver.makeIntVarArray(n, 0, 10, "x");
|
|
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Constraints
|
2012-01-21 16:13:17 +00:00
|
|
|
//
|
2018-10-31 16:18:18 +01:00
|
|
|
solver.addConstraint(solver.makeEquality(solver.makeScalProd(x, price).var(), total));
|
2011-03-21 18:40:46 +00:00
|
|
|
|
|
|
|
|
//
|
|
|
|
|
// Search
|
|
|
|
|
//
|
2018-10-31 16:18:18 +01:00
|
|
|
DecisionBuilder db = solver.makePhase(x, solver.CHOOSE_FIRST_UNBOUND, solver.ASSIGN_MIN_VALUE);
|
2011-03-21 18:40:46 +00:00
|
|
|
solver.newSearch(db);
|
|
|
|
|
|
|
|
|
|
while (solver.nextSolution()) {
|
|
|
|
|
System.out.print("x: ");
|
2018-10-31 16:18:18 +01:00
|
|
|
for (int i = 0; i < n; i++) {
|
2011-03-21 18:40:46 +00:00
|
|
|
System.out.print(x[i].value() + " ");
|
|
|
|
|
}
|
|
|
|
|
System.out.println();
|
|
|
|
|
}
|
|
|
|
|
solver.endSearch();
|
|
|
|
|
|
|
|
|
|
// Statistics
|
|
|
|
|
System.out.println();
|
|
|
|
|
System.out.println("Solutions: " + solver.solutions());
|
|
|
|
|
System.out.println("Failures: " + solver.failures());
|
|
|
|
|
System.out.println("Branches: " + solver.branches());
|
2012-01-21 17:15:03 +00:00
|
|
|
System.out.println("Wall time: " + solver.wallTime() + "ms");
|
2011-03-21 18:40:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public static void main(String[] args) throws Exception {
|
2020-09-11 21:17:23 +02:00
|
|
|
Loader.loadNativeLibraries();
|
2011-03-21 18:40:46 +00:00
|
|
|
Xkcd.solve();
|
|
|
|
|
}
|
|
|
|
|
}
|