54 static const int x_n = 7;
56 static const int e_n = 20;
64 int eqs[e_n][x_n+1] = {
65 {876370, -16105, 62397, -6704, 43340, 95100, -68610, 58301},
66 {533909, 51637, 67761, 95951, 3834, -96722, 59190, 15280},
67 {915683, 1671, -34121, 10763, 80609, 42532, 93520, -33488},
68 {129768, 71202, -11119, 73017, -38875, -14413, -29234, 72370},
69 {752447, 8874, -58412, 73947, 17147, 62335, 16005, 8632},
70 {90614, 85268, 54180, -18810, -48219, 6013, 78169, -79785},
71 {1198280, -45086, 51830, -4578, 96120, 21231, 97919, 65651},
72 {18465, -64919, 80460, 90840, -59624, -75542, 25145, -47935},
73 {1503588, -43277, 43525, 92298, 58630, 92590, -9372, -60227},
74 {1244857, -16835, 47385, 97715, -12640, 69028, 76212, -81102},
75 {1410723, -60301, 31227, 93951, 73889, 81526, -72702, 68026},
76 {25334, 94016, -82071, 35961, 66597, -30705, -44404, -38304},
77 {277271, -67456, 84750, -51553, 21239, 81675, -99395, -4254},
78 {249912, -85698, 29958, 57308, 48789, -78219, 4657, 34539},
79 {373854, 85176, -95332, -1268, 57898, 15883, 50547, 83287},
80 {740061, -10343, 87758, -11782, 19346, 70072, -36991, 44529},
81 {146074, 49149, 52871, -7132, 56728, -33576, -49530, -62089},
82 {251591, -60113, 29475, 34421, -76870, 62646, 29278, -15212},
83 {22167, 87059, -29101, -5513, -21219, 22128, 7276, 57308},
84 {821228, -76706, 98205, 23445, 67921, 24111, -48614, -41906}
87 for (
int i = e_n;
i--; ) {
88 IntArgs c(x_n, eqs[
i][1],eqs[i][2],eqs[i][3],eqs[i][4],
89 eqs[i][5],eqs[i][6],eqs[i][7]);
97 x.
update(*
this, share, s.x);
102 return new Eq20(share,*
this);
107 os <<
"\tx[] = " << x << std::endl;
120 opt.
parse(argc,argv);
121 Script::run<Eq20,DFS,Options>(
opt);
IntVarBranch INT_VAR_NONE(void)
Select first unassigned variable.
void linear(Home home, const FloatVarArgs &x, FloatRelType frt, FloatNum c)
Post propagator for .
virtual void print(std::ostream &os) const
Print solution.
Parametric base-class for scripts.
void iterations(unsigned int i)
Set default number of iterations.
void update(Space &, bool share, VarArray< Var > &a)
Update array to be a clone of array a.
Gecode::FloatVal c(-8, 8)
Example: Solving 20 linear equations
Gecode::IntArgs i(4, 1, 2, 3, 4)
IntValBranch INT_VAL_MIN(void)
Select smallest value.
virtual Space * copy(bool share)
Perform copying during cloning.
Eq20(const Options &opt)
The actual problem.
Passing integer arguments.
void parse(int &argc, char *argv[])
Parse options from arguments argv (number is argc)
Node * x
Pointer to corresponding Boolean expression node.
void solutions(unsigned int n)
Set default number of solutions to search for.
Gecode toplevel namespace
int main(int argc, char *argv[])
Main-function.
BrancherHandle branch(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf, FloatVarValPrint vvp)
Branch over x with variable selection vars and value selection vals.
void icl(IntConLevel i)
Set default integer consistency level.
Eq20(bool share, Eq20 &s)
Constructor for cloning s.