From db1d685414ac9257082803be8af9b27a088d8938 Mon Sep 17 00:00:00 2001 From: Jesse Luehrs Date: Fri, 15 May 2009 10:05:49 -0500 Subject: mark these old ones as non-working --- 145-broken.lua | 12 ++++++++++++ 145.lua | 12 ------------ 189-broken.lua | 27 +++++++++++++++++++++++++++ 189.lua | 27 --------------------------- 4 files changed, 39 insertions(+), 39 deletions(-) create mode 100644 145-broken.lua delete mode 100644 145.lua create mode 100644 189-broken.lua delete mode 100644 189.lua diff --git a/145-broken.lua b/145-broken.lua new file mode 100644 index 0000000..1713881 --- /dev/null +++ b/145-broken.lua @@ -0,0 +1,12 @@ +-- this will take ~6h to run... need efficiency! +function reversible(n) + local revn = n:reverse() + local str = tostring(n + revn) + return not str:match("[02468]") +end + +local sum = 0 +for i = 1, 999999999 do + if i % 10 ~= 0 and reversible(tostring(i)) then sum = sum + 1 end +end +print(sum) diff --git a/145.lua b/145.lua deleted file mode 100644 index 1713881..0000000 --- a/145.lua +++ /dev/null @@ -1,12 +0,0 @@ --- this will take ~6h to run... need efficiency! -function reversible(n) - local revn = n:reverse() - local str = tostring(n + revn) - return not str:match("[02468]") -end - -local sum = 0 -for i = 1, 999999999 do - if i % 10 ~= 0 and reversible(tostring(i)) then sum = sum + 1 end -end -print(sum) diff --git a/189-broken.lua b/189-broken.lua new file mode 100644 index 0000000..a4ae546 --- /dev/null +++ b/189-broken.lua @@ -0,0 +1,27 @@ +local triangle_graph = { +} + +--[[ +http://en.wikipedia.org/wiki/Graph_coloring#Computing_the_chromatic_polynomial +]] +function chromatic_polynomial(g, t) + local edge_start + for v1, edges in ipairs(g) do + for v2index, v2 in ipairs(edges) do + if v1 == v2 then return 0 end + if not edge_start then edge_start = v1 end + end + end + + if edge_start == nil then return t^#g end + + local edge_end = table.remove(g[edge_start]) + local edge_removed = chromatic_polynomial(g, t) + table.insert(g[edge_start], edge_end) + + -- need to contract the edge here + local edge_contracted = chromatic_polynomial(g, t) + -- and then fix it back up + + return edge_removed - edge_contracted +end diff --git a/189.lua b/189.lua deleted file mode 100644 index a4ae546..0000000 --- a/189.lua +++ /dev/null @@ -1,27 +0,0 @@ -local triangle_graph = { -} - ---[[ -http://en.wikipedia.org/wiki/Graph_coloring#Computing_the_chromatic_polynomial -]] -function chromatic_polynomial(g, t) - local edge_start - for v1, edges in ipairs(g) do - for v2index, v2 in ipairs(edges) do - if v1 == v2 then return 0 end - if not edge_start then edge_start = v1 end - end - end - - if edge_start == nil then return t^#g end - - local edge_end = table.remove(g[edge_start]) - local edge_removed = chromatic_polynomial(g, t) - table.insert(g[edge_start], edge_end) - - -- need to contract the edge here - local edge_contracted = chromatic_polynomial(g, t) - -- and then fix it back up - - return edge_removed - edge_contracted -end -- cgit v1.2.3