Data update

Task/Truncatable-primes/EasyLang/truncatable-primes.easy

@@ -0,0 +1,46 @@
+fastfunc isprim num .
+   if num < 2
+      return 0
+   .
+   i = 2
+   while i <= sqrt num
+      if num mod i = 0
+         return 0
+      .
+      i += 1
+   .
+   return 1
+.
+func isright h .
+   while h > 0
+      if isprim h = 0
+         return 0
+      .
+      h = h div 10
+   .
+   return 1
+.
+func isleft h .
+   d = pow 10 (floor log10 h)
+   while h > 0
+      if isprim h = 0
+         return 0
+      .
+      if h div d = 0
+         return 0
+      .
+      h = h mod d
+      d /= 10
+   .
+   return 1
+.
+p = 999999
+while isleft p = 0
+   p -= 2
+.
+print p
+p = 999999
+while isright p = 0
+   p -= 2
+.
+print p

Task/Truncatable-primes/Elena/truncatable-primes.elena

@@ -10,9 +10,9 @@ extension mathOp
 
         if (n < 2) { ^ false };
         if (n < 4) { ^ true };
-        if (n.mod:2 == 0) { ^ false };
+        if (n.mod(2) == 0) { ^ false };
         if (n < 9) { ^ true };
-        if (n.mod:3 == 0) { ^ false };
+        if (n.mod(3) == 0) { ^ false };
 
         int r := n.sqrt();
         int f := 5;

Task/Truncatable-primes/Wren/truncatable-primes.wren

@@ -1,5 +1,5 @@
-import "/fmt" for Fmt
-import "/math" for Int
+import "./fmt" for Fmt
+import "./math" for Int
 
 var limit = 999999
 var c = Int.primeSieve(limit, false)