grocery.cc
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 * Last modified: 00010 * $Date: 2008-01-31 21:06:01 +0100 (Thu, 31 Jan 2008) $ by $Author: schulte $ 00011 * $Revision: 6024 $ 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 "examples/support.hh" 00039 #include "gecode/minimodel.hh" 00040 00057 class Grocery : public Example { 00058 protected: 00060 IntVarArray x; 00062 static const int s = 711; 00063 public: 00065 Grocery(const Options&) : x(this,4,0,s) { 00066 00067 // The sum of all variables is s 00068 post(this, x[0]+x[1]+x[2]+x[3] == s); 00069 00070 // The product of all variables is s (corrected by scale factor) 00071 rel(this, mult(this, mult(this, x[0], x[1]), mult(this, x[2], x[3])), 00072 IRT_EQ, s*100*100*100); 00073 00074 // Break symmetries: order the variables 00075 rel(this, x[0], IRT_LQ, x[1]); 00076 rel(this, x[1], IRT_LQ, x[2]); 00077 rel(this, x[2], IRT_LQ, x[3]); 00078 00079 branch(this, x, INT_VAR_SIZE_MIN, INT_VAL_SPLIT_MAX); 00080 } 00081 00083 Grocery(bool share, Grocery& s) : Example(share,s) { 00084 x.update(this, share, s.x); 00085 } 00086 00088 virtual Space* 00089 copy(bool share) { 00090 return new Grocery(share,*this); 00091 } 00092 00094 virtual void 00095 print(std::ostream& os) { 00096 os << "\t" << x << 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 Example::run<Grocery,DFS,Options>(opt); 00109 return 0; 00110 } 00111 00112 // STATISTICS: example-any 00113