#! /usr/bin/lua

-- by Michael Anderson at
-- https://stackoverflow.com/questions/8722620/comparing-two-index-tables-by-index-value-in-lua
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

  -- Check each key-value pair
  -- We have to do this both ways in case we miss some.
  -- TODO: Could probably be smarter and not check those we've 
  -- already checked though!
  for k1,v1 in pairs(t1) do
    local v2 = t2[k1]
    if( not recursive_compare(v1,v2) ) then return false end
  end
  for k2,v2 in pairs(t2) do
    local v1 = t1[k2]
    if( not recursive_compare(v1,v2) ) then return false end
  end

  return true  
end

function genprimes(mx)
   local primesh = {}
   for i = 2, 3 do
      primesh[i] = true
   end
   for i = 6, mx, 6 do
      for j = i-1, i+1, 2 do
         if j <= mx then
            primesh[j]=true
         end
      end
   end
   local q={2,3,5,7}
   local p=table.remove(q,1)
   local mr=math.floor(math.sqrt(mx))
   while p <= mr do
      if primesh[p] ~= nil then
         for i = p*p,mx,p do
            primesh[i] = nil
         end
      end
      if #q < 2 then
         table.insert(q,q[#q]+4)
         table.insert(q,q[#q]+2)
      end
      p=table.remove(q,1)
   end
   local primes = {}
   for k,v in pairs(primesh) do
      table.insert(primes,k)
   end
   table.sort(primes)
   return primes
end

function brilliant(n0)
   local base = 1
   local out = {}
   local n = 0
   while true do
      pl = genprimes(base * 10)
      for ai,av in pairs(pl) do
         if av >= base then
            for bi,bv in pairs(pl) do
               if bi >= ai then
                  c = av * bv
                  if out[c] == nil then
                     n = n + 1
                  end
                  out[c] = true
               end
            end
         end
      end
      if n >= n0 then
         break
      end
      base = base * 10
   end
   local o = {}
   for k,v in pairs(out) do
      table.insert(o,k)
   end
   table.sort(o)
   while #o > n0 do
      table.remove(o)
   end
   return o
end

if recursive_compare(brilliant(20), {4, 6, 9, 10, 14, 15, 21, 25, 35,
                                     49, 121, 143, 169, 187, 209, 221,
                                     247, 253, 289, 299}) then
   io.write("Pass")
else
   io.write("FAIL")
end
print("")