1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
#include <stdio.h>
#include <string.h>
#include <malloc.h>
#include <limits.h>
#include <stdint.h>
#include <assert.h>
#include "solver.h"
#define _log(...) fprintf(stderr, __VA_ARGS__)
#define _abs(x) (((x) < 0) ? -(x) : (x))
typedef uint8_t byte;
enum {
addition ,
substraction ,
multiplication ,
division ,
};
typedef struct {
int v1;
int v2;
byte op;
} computation_t;
typedef struct {
computation_t *computation;
int level;
} solution_t;
static solution_t solution_g;
static vect_t *vect_g;
static int result;
static int closer = -1;
/* {{{ display */
static void display_solution(void)
{
puts("found a (better) solution:");
for (int i = vect_g->len - 1; i >= solution_g.level; i--) {
char op;
int _result;
switch (solution_g.computation[i].op) {
case addition:
op = '+';
_result = solution_g.computation[i].v1 + solution_g.computation[i].v2;
break;
case substraction:
op = '-';
_result = solution_g.computation[i].v1 - solution_g.computation[i].v2;
break;
case multiplication:
op = '*';
_result = solution_g.computation[i].v1 * solution_g.computation[i].v2;
break;
case division:
op = '/';
_result = solution_g.computation[i].v1 / solution_g.computation[i].v2;
break;
default:
assert (0);
break;
}
printf("%d %c %d = %d\n", solution_g.computation[i].v1
, op
, solution_g.computation[i].v2
, _result);
}
puts("--------------------------");
}
/* }}} */
static inline
void construct_new_vect(vect_t *new_vect, vect_t *vect, unsigned v1, unsigned v2)
{
unsigned j = 0;
for (unsigned i = 0; i < vect->len; ++i) {
/* check is this is one of the taken values */
if (i == v1 || i == v2)
continue;
new_vect->array[j++] = vect->array[i];
}
}
static void solve_rec(vect_t *vect)
{
vect_t new_vect;
if (solution_g.level != 0 && ((unsigned)solution_g.level >= vect->len)) {
/* we have already found a better solution */
return;
}
if (vect->len == 0)
return;
for (unsigned i = 0; i < vect->len; ++i) {
if ((closer == -1)
|| (_abs(vect->array[i] - result) <= _abs(closer - result)))
{
closer = vect->array[i];
if (closer == result) {
solution_g.level = vect->len;
display_solution();
return;
}
}
}
new_vect.array = malloc(sizeof(int) * (vect->len - 1));
new_vect.len = vect->len - 1;
for (unsigned i = 0; i < vect->len; ++i) {
for (unsigned j = 0; j < vect->len; ++j) {
/* we cannot use the same value twice */
if (i == j)
continue;
/* construct the new vector */
construct_new_vect(&new_vect, vect, i, j);
solution_g.computation[vect->len - 1].v1 = vect->array[i];
solution_g.computation[vect->len - 1].v2 = vect->array[j];
/* try adding (no condition) */
new_vect.array[new_vect.len - 1] = vect->array[i] + vect->array[j];
solution_g.computation[vect->len - 1].op = addition;
solve_rec(&new_vect);
/* try substracting (must be > 0) */
if (vect->array[i] >= vect->array[j]) {
new_vect.array[new_vect.len - 1] = vect->array[i] - vect->array[j];
solution_g.computation[vect->len - 1].op = substraction;
solve_rec(&new_vect);
}
/* try multiplicating (no condition) */
new_vect.array[new_vect.len - 1] = vect->array[i] * vect->array[j];
solution_g.computation[vect->len - 1].op = multiplication;
solve_rec(&new_vect);
/* try dividing (no rest needed and cannot divide by 0) */
if ((vect->array[j] != 0) && (vect->array[i] % vect->array[j] == 0)) {
new_vect.array[new_vect.len - 1] = vect->array[i] / vect->array[j];
solution_g.computation[vect->len - 1].op = division;
solve_rec(&new_vect);
}
}
}
free(new_vect.array);
}
/* public function to use */
void solve(vect_t *vect, int _result)
{
vect_g = vect;
result = _result;
solution_g.computation = malloc(sizeof(computation_t) * vect->len);
solution_g.level = 0;
solve_rec(vect);
if (closer == result) {
puts("Le compte est bon!");
} else {
result = closer;
closer = -1;
solve_rec(vect);
}
free(solution_g.computation);
}
|
