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 * Last modified: 00010 * $Date: 2009-09-30 12:12:35 +0200 (Wed, 30 Sep 2009) $ by $Author: tack $ 00011 * $Revision: 9779 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 #include <gecode/driver.hh> 00039 #include <gecode/int.hh> 00040 #include <gecode/minimodel.hh> 00041 00042 using namespace Gecode; 00043 00060 class Grocery : public Script { 00061 protected: 00063 IntVarArray abcd; 00065 static const int s = 711; 00067 static const int p = 711 * 100 * 100 * 100; 00068 public: 00070 Grocery(const Options& opt) : abcd(*this,4,0,s) { 00071 IntVar a(abcd[0]), b(abcd[1]), c(abcd[2]), d(abcd[3]); 00072 // The sum of all variables is s 00073 post(*this, a+b+c+d == s, opt.icl()); 00074 00075 // The product of all variables is s (corrected by scale factor) 00076 rel(*this, 00077 mult(*this, 00078 mult(*this, a, b, opt.icl()), 00079 mult(*this, c, d, opt.icl()), 00080 opt.icl()), 00081 IRT_EQ, p); 00082 00083 // Break symmetries: order the variables 00084 rel(*this, a, IRT_LQ, b); 00085 rel(*this, b, IRT_LQ, c); 00086 rel(*this, c, IRT_LQ, d); 00087 00088 branch(*this, abcd, INT_VAR_NONE, INT_VAL_SPLIT_MAX); 00089 } 00090 00092 Grocery(bool share, Grocery& s) : Script(share,s) { 00093 abcd.update(*this, share, s.abcd); 00094 } 00095 00097 virtual Space* 00098 copy(bool share) { 00099 return new Grocery(share,*this); 00100 } 00101 00103 virtual void 00104 print(std::ostream& os) const { 00105 os << "\t" << abcd << std::endl; 00106 } 00107 }; 00108 00112 int 00113 main(int argc, char* argv[]) { 00114 Options opt("Grocery"); 00115 opt.iterations(20); 00116 opt.parse(argc,argv); 00117 Script::run<Grocery,DFS,Options>(opt); 00118 return 0; 00119 } 00120 00121 // STATISTICS: example-any 00122