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 * Last modified: 00010 * $Date: 2010-10-07 11:52:01 +0200 (Thu, 07 Oct 2010) $ by $Author: schulte $ 00011 * $Revision: 11473 $ 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 00073 // The sum of all variables is s 00074 rel(*this, a+b+c+d == s, opt.icl()); 00075 00076 // The product of all variables is s (corrected by scale factor) 00077 rel(*this, (a*b)*(c*d) == p, opt.icl()); 00078 00079 // Break symmetries: order the variables 00080 rel(*this, abcd, IRT_LQ); 00081 00082 branch(*this, abcd, INT_VAR_NONE, INT_VAL_SPLIT_MAX); 00083 } 00084 00086 Grocery(bool share, Grocery& s) : Script(share,s) { 00087 abcd.update(*this, share, s.abcd); 00088 } 00089 00091 virtual Space* 00092 copy(bool share) { 00093 return new Grocery(share,*this); 00094 } 00095 00097 virtual void 00098 print(std::ostream& os) const { 00099 os << "\t" << abcd << std::endl; 00100 } 00101 }; 00102 00106 int 00107 main(int argc, char* argv[]) { 00108 Options opt("Grocery"); 00109 opt.iterations(20); 00110 opt.parse(argc,argv); 00111 Script::run<Grocery,DFS,Options>(opt); 00112 return 0; 00113 } 00114 00115 // STATISTICS: example-any 00116