Merge remote-tracking branch 'upstream/master'

2 files changed, 111 insertions, 0 deletions

diff --git a/challenge-149/abigail/java/ch-1.java b/challenge-149/abigail/java/ch-1.java
new file mode 100644
index 0000000000..feed6ae6ae
--- /dev/null
+++ b/challenge-149/abigail/java/ch-1.java
@@ -0,0 +1,58 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-149
+//
+
+//
+// Run as: ln ch-1.java ch1.java; javac ch1.java; java ch1 < input-file
+//
+
+import java.util.*;
+import java.util.Map;
+
+public class ch1 {
+    private static int digit_sum (int n) {
+        int sum  =  0;
+        int base = 10;
+        while (n > 0) {
+            sum += n % base;
+            n    = (int) Math . floor (n / base);
+        }
+        return (sum);
+    }
+
+    private static int fib_prev = 0;
+    private static int fib_last = 1;
+    private static Map <Integer, Boolean> fib =
+         new Hashtable <Integer, Boolean> ();
+
+    private static void fib_init () {
+        fib . put (fib_prev, true);
+        fib . put (fib_last, true);
+    }
+
+    private static boolean is_fib (int n) { 
+        while (fib_last < n) {
+            int t     = fib_last;
+            fib_last += fib_prev;
+            fib_prev  = t;
+            fib . put (fib_last, true);
+        }
+        return (fib . containsKey (n));
+    }
+
+
+    public static void main (String [] args) {
+        fib_init ();
+        Scanner scanner = new Scanner (System . in);
+        while (scanner . hasNextInt ()) {
+            int n = scanner . nextInt ();
+            for (int k = 0; n > 0; k ++) {
+                if (is_fib (digit_sum (k))) {
+                    System . out . printf ("%d ", k);
+                    n --;
+                }
+            }
+            System . out . printf ("\n");
+        }
+    }
+}
diff --git a/challenge-149/abigail/java/ch-2.java b/challenge-149/abigail/java/ch-2.java
new file mode 100644
index 0000000000..981d696747
--- /dev/null
+++ b/challenge-149/abigail/java/ch-2.java
@@ -0,0 +1,53 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-149
+//
+
+//
+// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2 < input-file
+//
+
+import java.util.*;
+
+public class ch2 {
+    public static void main (String [] args) {
+        int max_base = 25;
+        String [] A287298 = new String [26];
+        A287298 [ 0] =                          "";
+        A287298 [ 1] =                          "";
+        A287298 [ 2] =                         "1";
+        A287298 [ 3] =                         "1";
+        A287298 [ 4] =                      "3201";
+        A287298 [ 5] =                      "4301";
+        A287298 [ 6] =                    "452013";
+        A287298 [ 7] =                   "6250341";
+        A287298 [ 8] =                  "47302651";
+        A287298 [ 9] =                 "823146570";
+        A287298 [10] =                "9814072356";
+        A287298 [11] =               "A8701245369";
+        A287298 [12] =              "B8750A649321";
+        A287298 [13] =              "CBA504216873";
+        A287298 [14] =            "DC71B30685A924";
+        A287298 [15] =           "EDAC93B24658701";
+        A287298 [16] =          "FED5B39A42706C81";
+        A287298 [17] =          "GFED5A31C6B79802";
+        A287298 [18] =        "HGF80ADC53712EB649";
+        A287298 [19] =       "IHGFD3408C6E715A2B9";
+        A287298 [20] =      "JIHG03DAC457BFE96281";
+        A287298 [21] =                          "";
+        A287298 [22] =    "LKJIG5D14B9032FHAC867E";
+        A287298 [23] =   "MLKJEFG5IC1D9H8042AB376";
+        A287298 [24] =  "NMLKJ2BD0639GFE7C8IH5A41";
+        A287298 [25] = "ONMLKD8CJE2H47F6395I0B1AG";
+    
+        Scanner scanner = new Scanner (System . in);
+        while (scanner . hasNextInt ()) {
+            int n = scanner . nextInt ();
+            if (n > max_base || A287298 [n] . length () == 0) {
+                System . out . println ("Too hard to calculate");
+            }
+            else {
+                System . out . printf ("%s\n", A287298 [n]);
+            }
+        }
+    }
+}