From f6b8071c5ec3c2470b8e1ba37908648e0dbededc Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.freedom.nl>
Date: Sat, 15 Jan 2022 17:17:33 +0100
Subject: Week 147: Java solutions

---
 challenge-147/abigail/java/ch-2.java | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 challenge-147/abigail/java/ch-2.java

(limited to 'challenge-147/abigail/java/ch-2.java')

diff --git a/challenge-147/abigail/java/ch-2.java b/challenge-147/abigail/java/ch-2.java
new file mode 100644
index 0000000000..5469775b97
--- /dev/null
+++ b/challenge-147/abigail/java/ch-2.java
@@ -0,0 +1,32 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-147
+//
+
+//
+// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2
+//
+
+import java.util.*;
+
+public class ch2 {
+    public static void main (String [] args) {
+        int p = 0;
+        int n = 0;
+        Map <Integer, Boolean> pentagon = new Hashtable <Integer, Boolean> ();
+        boolean done = false;
+        while (true) {
+            p += n + n + n + 1;
+            n ++;
+            pentagon . put (p, true);
+            for (Map . Entry <Integer, Boolean> entry: pentagon . entrySet ()) {
+                Integer seen = entry . getKey ();
+                if (seen + seen < p &&
+                    pentagon . containsKey (p - seen) &&
+                    pentagon . containsKey (p - seen - seen)) {
+                    System . out . printf ("%d %d\n", seen, p - seen);
+                    return;
+                }
+            }
+        }
+    }
+}
-- 
cgit