Merge pull request #4017 from Abigail/abigail/week-111

Abigail/week 111

2 files changed, 58 insertions, 0 deletions

diff --git a/challenge-111/abigail/lua/ch-1.lua b/challenge-111/abigail/lua/ch-1.lua
new file mode 100644
index 0000000000..194e55b458
--- /dev/null
+++ b/challenge-111/abigail/lua/ch-1.lua
@@ -0,0 +1,33 @@
+#!/opt/local/bin/lua
+
+--
+-- See ../README.md
+--
+
+--
+-- Run as: lua ch-1.lua < input-file
+--
+
+local MATRIX_SIZE = 5
+
+matrix = {}
+
+-- 
+-- Read in the matrix
+--
+for i = 1, MATRIX_SIZE * MATRIX_SIZE do 
+    matrix [io . read ("*number")] = 1
+end
+
+--
+-- Read in the rest, printing 1/0 depending on
+-- whether the number is present in the matrix or not.
+--
+while true do
+    target = io . read ("*number")
+    if   target == nil then break end
+    if   matrix [target]
+    then print (1)
+    else print (0)
+    end
+end
diff --git a/challenge-111/abigail/lua/ch-2.lua b/challenge-111/abigail/lua/ch-2.lua
new file mode 100644
index 0000000000..6beeb6a979
--- /dev/null
+++ b/challenge-111/abigail/lua/ch-2.lua
@@ -0,0 +1,25 @@
+#!/opt/local/bin/lua
+
+--
+-- See ../README.md
+--
+
+--
+-- Run as: lua ch-2.lua < input-file
+--
+
+local longest = ""
+
+for line in io . lines () do
+    --
+    -- Find words with their letters in lexical order, and which are
+    -- longer than the longest found so far.
+    --
+    if   line : lower ()
+              : find  ("^a*b*c*d*e*f*g*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*$")
+         and line : len () > longest : len ()
+    then longest = line
+    end
+end
+
+print (longest)