Merge pull request #9415 from Firedrake/rogerbw-challenge-252

RogerBW solutions for challenge no. 252

2 files changed, 90 insertions, 0 deletions

diff --git a/challenge-252/roger-bell-west/lua/ch-1.lua b/challenge-252/roger-bell-west/lua/ch-1.lua
new file mode 100755
index 0000000000..de7ec27e60
--- /dev/null
+++ b/challenge-252/roger-bell-west/lua/ch-1.lua
@@ -0,0 +1,26 @@
+#! /usr/bin/lua
+
+function specialnumbers(a)
+   local t = 0
+   for i, n in ipairs(a) do
+      if #a % i == 0 then
+         t = t + n * n
+      end
+   end
+   return t
+end
+
+if specialnumbers({1, 2, 3, 4}) == 21 then
+  io.write("Pass")
+else
+  io.write("FAIL")
+end
+io.write(" ")
+
+if specialnumbers({2, 7, 1, 19, 18, 3}) == 63 then
+  io.write("Pass")
+else
+  io.write("FAIL")
+end
+print("")
+
diff --git a/challenge-252/roger-bell-west/lua/ch-2.lua b/challenge-252/roger-bell-west/lua/ch-2.lua
new file mode 100755
index 0000000000..b262f82a1e
--- /dev/null
+++ b/challenge-252/roger-bell-west/lua/ch-2.lua
@@ -0,0 +1,64 @@
+#! /usr/bin/lua
+
+-- by Michael Anderson at
+-- https://stackoverflow.com/questions/8722620/comparing-two-index-tables-by-index-value-in-lua
+-- modified by Roger
+function recursive_compare(t1,t2)
+  -- Use usual comparison first.
+  if t1==t2 then return true end
+  -- We only support non-default behavior for tables
+  if (type(t1)~="table") then return false end
+  -- They better have the same metatables
+  local mt1 = getmetatable(t1)
+  local mt2 = getmetatable(t2)
+  if( not recursive_compare(mt1,mt2) ) then return false end
+  -- Build list of all keys
+  local kk = {}
+  for k1, _ in pairs(t1) do
+     kk[k1] = true
+  end
+  for k2, _ in pairs(t2) do
+     kk[k2] = true
+  end
+  -- Check each key that exists in at least one table
+  for _, k in ipairs(kk) do
+     if (not recursive_compare(t1[k], t2[k])) then
+        return false
+     end
+  end
+  return true
+end
+
+function uniquesumzero(n)
+   if n == 1 then
+      return { 0 }
+   end
+   local p = {}
+   for j = 1, n-1 do
+      table.insert(p, j)
+   end
+   table.insert(p, -n * (n-1) / 2)
+   return p
+end
+
+if recursive_compare(uniquesumzero(5), {1, 2, 3, 4, -10}) then
+  io.write("Pass")
+else
+  io.write("FAIL")
+end
+io.write(" ")
+
+if recursive_compare(uniquesumzero(3), {1, 2, -3}) then
+  io.write("Pass")
+else
+  io.write("FAIL")
+end
+io.write(" ")
+
+if recursive_compare(uniquesumzero(1), {0}) then
+  io.write("Pass")
+else
+  io.write("FAIL")
+end
+print("")
+