Hints for last_elem/2 added.

2 files changed, 4 insertions, 1 deletions

diff --git a/prolog/problems/lists/last_elem_2/common.py b/prolog/problems/lists/last_elem_2/common.py
index 4014b13..8c08d61 100644
--- a/prolog/problems/lists/last_elem_2/common.py
+++ b/prolog/problems/lists/last_elem_2/common.py
@@ -80,7 +80,8 @@ def hint(code, aux_code):
             return [{'id': 'base_case'}]
 
         # target predicate seems to always be false
-        if not prolog.engine.ask_truthTO(engine_id, 'last_elem([_,_,_,_,_,_], _)'):
+        if not prolog.engine.ask_truthTO(engine_id, 'last_elem(_, _)') and \
+           not prolog.engine.ask_truthTO(engine_id, 'last_elem([_,_,_,_,_,_], _)'):
             return [{'id': 'predicate_always_false'}]
 
         # base case works, the recursive doesn't (but it doesn't timeout)
diff --git a/prolog/problems/lists/last_elem_2/sl.py b/prolog/problems/lists/last_elem_2/sl.py
index 91ae527..c0d8082 100644
--- a/prolog/problems/lists/last_elem_2/sl.py
+++ b/prolog/problems/lists/last_elem_2/sl.py
@@ -64,5 +64,7 @@ in seznam dolžine ena (v tem vrstnem redu)? Seznam dolžine ena seveda zapišem
 <p>Znaš sedaj dobiti zadnji element s pomočjo <code>conc/3</code>? To bo že še prišlo prav. Seveda pa je dostop
 do zadnjega elementa še vedno potraten, O(n). Zato, če ni važno od kje ali kam dostopati, se splača vedno delati
 s prvim elementom.</p>
+<p>Kaj pa naredi tole? ;)</p>
+<p><code>?- conc([a,b,c], [q], L).</code></p>
 ''',
 }