Add tasks for all the new languages

Task/Truncatable-primes/EchoLisp/truncatable-primes-1.echolisp

@@ -0,0 +1,16 @@
+;; does p include a 0 in its decimal representation ?
+(define (nozero? n) (= -1 (string-index (number->string n) "0")))
+
+;; right truncate : p and successive quotients by 10 (integer division) must be primes
+(define (right-trunc p) (unless (zero? p)
+	(and (prime? p) (right-trunc (quotient p 10)))))
+(remember 'right-trunc)
+
+;; left truncate : p and successive modulo by 10, 100, .. must be prime
+(define (left-trunc p (mod 1000000))
+	(unless (< mod 1)
+	(and (prime? p) (nozero? p) (left-trunc (modulo p mod) (/ mod 10)))))
+
+;; start from 999999. stop on first found
+(define (fact-trunc trunc)
+(for ((p (in-range 999999 100000 -1))) #:break (when (trunc p) (writeln p) #t)))

Task/Truncatable-primes/EchoLisp/truncatable-primes-2.echolisp

@@ -0,0 +1,4 @@
+(fact-trunc left-trunc)
+998443
+(fact-trunc right-trunc)
+739399

Task/Truncatable-primes/Nim/truncatable-primes.nim

@@ -0,0 +1,34 @@
+import sets, strutils, algorithm
+
+proc primes(n): seq[int64] =
+  result = @[]
+  var multiples = initSet[int64]()
+  for i in 2..n:
+    if i notin multiples:
+      result.add i
+      for j in countup(i*i, n, i.int):
+        multiples.incl j
+
+proc truncatablePrime(n): tuple[left: int64, right: int64] =
+  var
+    primelist: seq[string] = @[]
+  for x in primes(n):
+    primelist.add($x)
+  reverse primelist
+  var primeset = toSet primelist
+  for n in primelist:
+    var alltruncs = initSet[string]()
+    for i in 0..n.len:
+      alltruncs.incl n[1..n.high]
+    if alltruncs <= primeset:
+      result.left = parseInt(n)
+      break
+  for n in primelist:
+    var alltruncs = initSet[string]()
+    for i in 0..n.len:
+      alltruncs.incl n[0..i]
+    if alltruncs <= primeset:
+      result.right = parseInt(n)
+      break
+
+echo truncatablePrime(1000000'i64)

Task/Truncatable-primes/Sidef/truncatable-primes.sidef

@@ -0,0 +1,14 @@
+func t_prime(n, left=true) {
+    var p = %w(2 3 5 7);
+    var f = (
+        left ? { '1'..'9' ~X+ p }
+             : { p ~X+ '1'..'9' }
+    )
+    n.times {
+        p = f().grep{ .to_i.is_prime }
+    }
+    p.map{.to_i}.max
+}
+
+say t_prime(5, left: true)
+say t_prime(5, left: false)