2 files changed, 80 insertions, 0 deletions
diff --git a/challenge-003/abigail/java/ch-1.java b/challenge-003/abigail/java/ch-1.java
new file mode 100644
index 0000000000..651f938314
--- /dev/null
+++ b/challenge-003/abigail/java/ch-1.java
@@ -0,0 +1,46 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-003
+//
+
+//
+// Run as: ln ch-1.java ch1.java; javac ch1.java; java ch1 < input-file
+//
+
+import java.util.*;
+
+public class ch1 {
+    public static void main (String [] args) {
+        Scanner scanner = new Scanner (System . in);
+        while (scanner . hasNextInt ()) {
+            int max = scanner . nextInt ();
+            long [] ugly = new long [max];
+
+            ugly [0]   = 1L;
+            int count  = 0;
+            int next_2 = 0;
+            int next_3 = 0;
+            int next_5 = 0;
+
+            while (count < max - 1) {
+                count ++;
+                long min = 0;
+
+                long c2 = 2 * ugly [next_2];
+                long c3 = 3 * ugly [next_3];
+                long c5 = 5 * ugly [next_5];
+
+                if (c2 <= c3 && c2 <= c5) {min = c2;}
+                if (c3 <= c2 && c3 <= c5) {min = c3;}
+                if (c5 <= c2 && c5 <= c3) {min = c5;}
+
+                ugly [count] = min;
+
+                if (c2 <= ugly [count]) {next_2 ++;}
+                if (c3 <= ugly [count]) {next_3 ++;}
+                if (c5 <= ugly [count]) {next_5 ++;}
+            }
+
+            System . out . println (ugly [count]);
+        }
+    }
+}
diff --git a/challenge-003/abigail/java/ch-2.java b/challenge-003/abigail/java/ch-2.java
new file mode 100644
index 0000000000..8f932a81db
--- /dev/null
+++ b/challenge-003/abigail/java/ch-2.java
@@ -0,0 +1,34 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-003
+//
+
+//
+// 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) {
+        Scanner scanner = new Scanner (System . in);
+        while (scanner . hasNextInt ()) {
+            int max = scanner . nextInt ();
+            int [] current_row = new int [1];
+            current_row [0] = 1;
+            System . out . println ("1");
+
+            for (int row = 1; row <= max; row ++) {
+                int [] next_row = new int [row + 1];
+                next_row [0]   = 1;
+                next_row [row] = 1;
+                System . out . print ("1 ");
+                for (int col = 1; col < row; col ++) {
+                    next_row [col] = current_row [col - 1] + current_row [col];
+                    System . out . printf ("%d ", next_row [col]);
+                }
+                System . out . println ("1");
+                current_row = next_row;
+            }
+        }
+    }
+}