Exported all problems from the SQLite database into the new directory structure.

10 files changed, 189 insertions, 0 deletions

diff --git a/prolog/problems/license_plates/checklicenseplate_3/common.py b/prolog/problems/license_plates/checklicenseplate_3/common.py
new file mode 100644
index 0000000..f926481
--- /dev/null
+++ b/prolog/problems/license_plates/checklicenseplate_3/common.py
@@ -0,0 +1,52 @@
+id = 148
+group = 'license_plates'
+number = 55
+visible = True
+facts = None
+
+solution = '''\
+conc148([], L, L).
+conc148([H|T], L2, [H|L]) :-
+  conc148(T, L2, L).
+
+memb148(X, [X|_]).
+memb148(X, [_|T]) :-
+  memb148(X, T).
+
+getdigits148([], []).
+getdigits148([X|T], [X|NT]) :-
+  number(X), !,
+  getdigits148(T, NT).
+getdigits148([_|T], NT) :-
+  getdigits148(T, NT).
+
+joindigits148([X], [X]).
+joindigits148([X,Y|T], NT) :-
+  XY is 10*X + Y,
+  joindigits148([XY|T], NT).
+joindigits148([X,Y|T], [X|NT]) :-
+  joindigits148([Y|T], NT).
+
+genexp148([Exp], Exp).
+genexp148(L, Exp) :-
+  conc148(Before, [N1,N2|After], L),
+  memb148(Op, ['+','-','*','/']),
+  NExp =.. [Op, N1, N2],
+  conc148(Before, [NExp|After], L1),
+  genexp148(L1, Exp).
+
+firstMinus148(L, L).
+firstMinus148([X|T], [Y|T]) :-
+  Y is -X.
+
+checkLicensePlate(LP, E1, E2) :-
+  getdigits148(LP, Digs),
+  conc148(L1, L2, Digs),
+  joindigits148(L1, N1),
+  joindigits148(L2, N2),
+  firstMinus148(N1, MN1),
+  firstMinus148(N2, MN2),
+  genexp148(MN1, E1),
+  genexp148(MN2, E2),
+  E1 =:= E2.
+'''
diff --git a/prolog/problems/license_plates/checklicenseplate_3/en.py b/prolog/problems/license_plates/checklicenseplate_3/en.py
new file mode 100644
index 0000000..1f3ea94
--- /dev/null
+++ b/prolog/problems/license_plates/checklicenseplate_3/en.py
@@ -0,0 +1,17 @@
+id = 148
+name = 'checkLicensePlate/3'
+slug = 'check if the numbers in a license plate form an equation'
+
+description = '''\
+<p><code>checkLicensePlate(LP, E1, E2)</code>: the digits in the list <code>LP</code> can be combined into a valid equation <code>E1</code> = <code>E2</code>. <code>E1</code> and <code>E2</code> are arithmetic expressions, obtained from sublists of <code>Plate</code> by inserting arithmetic operators (<code>+</code>, <code>-</code>, <code>*</code> and <code>/</code>) between elements. An additional unary minus can be inserted before the leftmost number of <code>E1</code> and <code>E2</code>.</p>
+<pre>
+  ?- checkLicensePlate([l,j,l,3,-,2,1,7], E1, E2).
+    E1 = 3,       E2 = 21/7 ;
+    E1 = -3,      E2 = -21/7 ;
+    E1 = 3*2,     E2 = -1+7 ;
+    E1 = -3*2,    E2 = 1-7 ;
+    E1 = 3*2+1,   E2 = 7 ;
+    E1 = -3*2-1,  E2 = -7.
+</pre>'''
+
+hint = {}
diff --git a/prolog/problems/license_plates/firstminus_2/common.py b/prolog/problems/license_plates/firstminus_2/common.py
new file mode 100644
index 0000000..9e971f6
--- /dev/null
+++ b/prolog/problems/license_plates/firstminus_2/common.py
@@ -0,0 +1,11 @@
+id = 147
+group = 'license_plates'
+number = 54
+visible = True
+facts = None
+
+solution = '''\
+firstMinus(L, L).
+firstMinus([X|T], [Y|T]) :-
+  Y is -X.
+'''
diff --git a/prolog/problems/license_plates/firstminus_2/en.py b/prolog/problems/license_plates/firstminus_2/en.py
new file mode 100644
index 0000000..9fb8c69
--- /dev/null
+++ b/prolog/problems/license_plates/firstminus_2/en.py
@@ -0,0 +1,13 @@
+id = 147
+name = 'firstMinus/2'
+slug = 'negate the first element in a list of numbers'
+
+description = '''\
+<p><code>firstMinus(L1, L2)</code>: the list <code>L2</code> is the same as <code>L1</code>, except for the first element that may be negated. Your code should return both solutions.</p>
+<pre>
+  ?- firstMinus([1,2,3], L).
+    L = [1,2,3] ;
+    L = [-1,2,3].
+</pre>'''
+
+hint = {}
diff --git a/prolog/problems/license_plates/genexp_2/common.py b/prolog/problems/license_plates/genexp_2/common.py
new file mode 100644
index 0000000..a91c392
--- /dev/null
+++ b/prolog/problems/license_plates/genexp_2/common.py
@@ -0,0 +1,23 @@
+id = 146
+group = 'license_plates'
+number = 53
+visible = True
+facts = None
+
+solution = '''\
+memb146(X, [X|_]).
+memb146(X, [_|T]) :-
+  memb146(X, T).
+
+conc146([], L, L).
+conc146([H|T], L2, [H|L]) :-
+  conc146(T, L2, L).
+
+genexp([Exp], Exp).
+genexp(L, Exp) :-
+  conc146(Before, [N1,N2|After], L),
+  memb146(Op, ['+','-','*','/']),
+  NExp =.. [Op, N1, N2],
+  conc146(Before, [NExp|After], L1),
+  genexp(L1, Exp).
+'''
diff --git a/prolog/problems/license_plates/genexp_2/en.py b/prolog/problems/license_plates/genexp_2/en.py
new file mode 100644
index 0000000..c5c61fb
--- /dev/null
+++ b/prolog/problems/license_plates/genexp_2/en.py
@@ -0,0 +1,18 @@
+id = 146
+name = 'genexp/2'
+slug = 'generate an arithmetic expression from a list'
+
+description = '''\
+<p><code>genexp(L, E)</code>: the expression <code>E</code> is obtained from the list <code>L</code> by inserting arithmetic operators between list elements. Your code should generate all valid solutions.</p>
+<pre>
+  ?- genexp([1,2,3], L).
+    L = 1+2+3 ;
+    L = 1+2-3 ;
+    L = (1+2)*3 ;
+    L = (1+2)/3 ;
+    L = 1-2+3 ;
+    L = 1-2-3 ;
+    ...
+</pre>'''
+
+hint = {}
diff --git a/prolog/problems/license_plates/getdigits_2/common.py b/prolog/problems/license_plates/getdigits_2/common.py
new file mode 100644
index 0000000..8d6e890
--- /dev/null
+++ b/prolog/problems/license_plates/getdigits_2/common.py
@@ -0,0 +1,14 @@
+id = 144
+group = 'license_plates'
+number = 51
+visible = True
+facts = None
+
+solution = '''\
+getdigits([], []).
+getdigits([X|T], [X|NT]) :-
+  number(X), !,
+  getdigits(T, NT).
+getdigits([_|T], NT) :-
+  getdigits(T, NT).
+'''
diff --git a/prolog/problems/license_plates/getdigits_2/en.py b/prolog/problems/license_plates/getdigits_2/en.py
new file mode 100644
index 0000000..06bfa22
--- /dev/null
+++ b/prolog/problems/license_plates/getdigits_2/en.py
@@ -0,0 +1,12 @@
+id = 144
+name = 'getdigits/2'
+slug = 'remove non-numeric elements from a list'
+
+description = '''\
+<p><code>getdigits(L, DL)</code>: the list <code>DL</code> contains the numeric elements of <code>L</code>, in the same order as in the original list.</p>
+<pre>
+  ?- getdigits([2,3,e,-,4,b], DL).
+    DL = [2,3,4].
+</pre>'''
+
+hint = {}
diff --git a/prolog/problems/license_plates/joindigits_2/common.py b/prolog/problems/license_plates/joindigits_2/common.py
new file mode 100644
index 0000000..dc3e4a5
--- /dev/null
+++ b/prolog/problems/license_plates/joindigits_2/common.py
@@ -0,0 +1,14 @@
+id = 145
+group = 'license_plates'
+number = 52
+visible = True
+facts = None
+
+solution = '''\
+joindigits([X], [X]).
+joindigits([X,Y|T], NT) :-
+  XY is 10*X + Y,
+  joindigits([XY|T], NT).
+joindigits([X,Y|T], [X|NT]) :-
+  joindigits([Y|T], NT).
+'''
diff --git a/prolog/problems/license_plates/joindigits_2/en.py b/prolog/problems/license_plates/joindigits_2/en.py
new file mode 100644
index 0000000..19623d7
--- /dev/null
+++ b/prolog/problems/license_plates/joindigits_2/en.py
@@ -0,0 +1,15 @@
+id = 145
+name = 'joindigits/2'
+slug = 'join adjacent numbers in a list'
+
+description = '''\
+<p><code>joindigits(L, NL)</code>: the list <code>NL</code> is obtained from <code>L</code> by arbitrarily joining neighboring digits. Your code should generate all valid solutions.</p>
+<pre>
+  ?- joindigits([3,2,4], NL).
+    NL = [324] ;
+    NL = [32,4] ;
+    NL = [3,24] ;
+    NL = [3,2,4].
+</pre>'''
+
+hint = {}