Rev 5505 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 5505 | Rev 8837 | ||
---|---|---|---|
Line 99... | Line 99... | ||
99 | 99 | ||
100 | /* tests if result is better */ |
100 | /* tests if result is better */ |
101 | void resultest(struct result * res) |
101 | void resultest(struct result * res) |
102 | { |
102 | { |
103 | int tmp; |
103 | int tmp; |
104 | if ((tmp = |
104 | if ((tmp = res->val - goal) < min) |
105 | { |
105 | { |
106 | min = tmp; |
106 | min = tmp; |
107 | best = res; |
107 | best = res; |
108 | if (!min) |
108 | if (!min) |
109 | { |
109 | { |
Line 166... | Line 166... | ||
166 | for (i = 0; i < 6; i++) |
166 | for (i = 0; i < 6; i++) |
167 | { |
167 | { |
168 | base[i] = resinit(); |
168 | base[i] = resinit(); |
169 | base[i]->val = atoi(argv[i+2]); |
169 | base[i]->val = atoi(argv[i+2]); |
170 | } |
170 | } |
171 | 171 | ||
172 | printf("Processing "); |
172 | printf("Processing "); |
173 | for (i = 0; i < 6; i++) |
173 | for (i = 0; i < 6; i++) |
174 | printf("%d ", base[i]->val); |
174 | printf("%d ", base[i]->val); |
175 | printf(". Goal : %d\n", goal); |
175 | printf(". Goal : %d\n", goal); |
176 | 176 | ||
177 | for (i = 0; i < 6; i++) |
177 | for (i = 0; i < 6; i++) |
178 | resultest(base[i]); |
178 | resultest(base[i]); |
179 | 179 | ||
180 | compute(base, 6); |
180 | compute(base, 6); |
181 | 181 | ||
182 | printf("NOTFOUND %d %d\n", best->val, min); |
182 | printf("NOTFOUND %d %d\n", best->val, min); |
183 | dispres(best); |
183 | dispres(best); |
184 | exit(0); |
184 | exit(0); |
185 | } |
185 | } |