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

2 files changed, 27 insertions, 0 deletions

diff --git a/prolog/problems/sorting/pivoting_4/common.py b/prolog/problems/sorting/pivoting_4/common.py
new file mode 100644
index 0000000..278f694
--- /dev/null
+++ b/prolog/problems/sorting/pivoting_4/common.py
@@ -0,0 +1,15 @@
+id = 124
+group = 'sorting'
+number = 31
+visible = True
+facts = None
+
+solution = '''\
+pivoting(_, [], [], []).
+pivoting(P, [H|T], [H|S], G) :-
+  H =< P,
+  pivoting(P, T, S, G).
+pivoting(P, [H|T], S, [H|G]) :-
+  H > P,
+  pivoting(P, T, S, G).
+'''
diff --git a/prolog/problems/sorting/pivoting_4/en.py b/prolog/problems/sorting/pivoting_4/en.py
new file mode 100644
index 0000000..4a1ab8c
--- /dev/null
+++ b/prolog/problems/sorting/pivoting_4/en.py
@@ -0,0 +1,12 @@
+id = 124
+name = 'pivoting/4'
+slug = 'split a list according to the pivot'
+
+description = '''\
+<p><code>pivoting(P, L, S, G)</code>: the list <code>S</code> contains the elements of <code>L</code> <em>smaller or equal to</em> <code>P</code>, and the list <code>G</code> contains the elements of <code>L</code> <em>greater than</em> <code>P</code>. The order of elements in <code>S</code> and <code>G</code> should be the same as in <code>L</code>.</p>
+<pre>
+  ?- pivoting(4, [1,4,5,8,6,4,2], S, G).
+    S = [1,4,4,2], G = [5,8,6].
+</pre>'''
+
+hint = {}