grocery.cpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2001 00008 * 00009 * This file is part of Gecode, the generic constraint 00010 * development environment: 00011 * http://www.gecode.org 00012 * 00013 * Permission is hereby granted, free of charge, to any person obtaining 00014 * a copy of this software and associated documentation files (the 00015 * "Software"), to deal in the Software without restriction, including 00016 * without limitation the rights to use, copy, modify, merge, publish, 00017 * distribute, sublicense, and/or sell copies of the Software, and to 00018 * permit persons to whom the Software is furnished to do so, subject to 00019 * the following conditions: 00020 * 00021 * The above copyright notice and this permission notice shall be 00022 * included in all copies or substantial portions of the Software. 00023 * 00024 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00025 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00026 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00027 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00028 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00029 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00030 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00031 * 00032 */ 00033 00034 #include <gecode/driver.hh> 00035 #include <gecode/int.hh> 00036 #include <gecode/minimodel.hh> 00037 00038 using namespace Gecode; 00039 00056 class Grocery : public Script { 00057 protected: 00059 IntVarArray abcd; 00061 static const int s = 711; 00063 static const int p = 711 * 100 * 100 * 100; 00064 public: 00066 Grocery(const Options& opt) 00067 : Script(opt), abcd(*this,4,0,s) { 00068 IntVar a(abcd[0]), b(abcd[1]), c(abcd[2]), d(abcd[3]); 00069 00070 // The sum of all variables is s 00071 rel(*this, a+b+c+d == s, opt.ipl()); 00072 00073 // The product of all variables is s (corrected by scale factor) 00074 rel(*this, (a*b)*(c*d) == p, opt.ipl()); 00075 00076 // Break symmetries: order the variables 00077 rel(*this, abcd, IRT_LQ); 00078 00079 branch(*this, abcd, INT_VAR_NONE(), INT_VAL_SPLIT_MAX()); 00080 } 00081 00083 Grocery(Grocery& s) : Script(s) { 00084 abcd.update(*this, s.abcd); 00085 } 00086 00088 virtual Space* 00089 copy(void) { 00090 return new Grocery(*this); 00091 } 00092 00094 virtual void 00095 print(std::ostream& os) const { 00096 os << "\t" << abcd << std::endl; 00097 } 00098 }; 00099 00103 int 00104 main(int argc, char* argv[]) { 00105 Options opt("Grocery"); 00106 opt.iterations(20); 00107 opt.parse(argc,argv); 00108 Script::run<Grocery,DFS,Options>(opt); 00109 return 0; 00110 } 00111 00112 // STATISTICS: example-any 00113