In [ ]:
# Copyright 2010 Pierre Schaus (pschaus@gmail.com)
# 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.
from __future__ import print_function
from ortools.constraint_solver import pywrapcp
def dudeney(n):
solver = pywrapcp.Solver('Dudeney')
x = [solver.IntVar(list(range(10)), 'x' + str(i)) for i in range(n)]
nb = solver.IntVar(list(range(3, 10**n)), 'nb')
s = solver.IntVar(list(range(1, 9 * n + 1)), 's')
solver.Add(nb == s * s * s)
solver.Add(sum([10**(n - i - 1) * x[i] for i in range(n)]) == nb)
solver.Add(sum([x[i] for i in range(n)]) == s)
solution = solver.Assignment()
solution.Add(nb)
collector = solver.AllSolutionCollector(solution)
solver.Solve(
solver.Phase(x, solver.INT_VAR_DEFAULT, solver.INT_VALUE_DEFAULT),
[collector])
for i in range(collector.SolutionCount()):
nbsol = collector.Value(i, nb)
print(nbsol)
print('#fails:', solver.Failures())
print('time:', solver.WallTime(), 'ms')