2 files changed, 55 insertions, 0 deletions
diff --git a/challenge-140/abigail/java/ch-1.java b/challenge-140/abigail/java/ch-1.java
new file mode 100644
index 0000000000..7d93af1d7d
--- /dev/null
+++ b/challenge-140/abigail/java/ch-1.java
@@ -0,0 +1,22 @@
+//
+// See ../README.md
+//
+
+//
+// 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 . hasNextLine ()) {
+            String line = scanner . nextLine ();
+            String [] parts = line . trim () . split (" ");
+            int a = Integer . parseInt (parts [0], 2);
+            int b = Integer . parseInt (parts [1], 2);
+            System . out . println (Integer . toBinaryString (a + b));
+        }
+    }
+}
diff --git a/challenge-140/abigail/java/ch-2.java b/challenge-140/abigail/java/ch-2.java
new file mode 100644
index 0000000000..90c4bd998f
--- /dev/null
+++ b/challenge-140/abigail/java/ch-2.java
@@ -0,0 +1,33 @@
+//
+// See ../README.md
+//
+
+//
+// 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 . hasNextLong ()) {
+            long i = scanner . nextLong ();
+            long j = scanner . nextLong ();
+            long k = scanner . nextLong ();
+            long n = 0;
+            while (k > 0) {
+                n ++;
+                long s = (long) Math . sqrt (n);
+                for (long d = 1; d <= s && k > 0; d ++) {
+                    if (n % d == 0) {
+                        if (d <= i && n / d <= j) {k --;}
+                        if (d <= j && n / d <= i) {k --;}
+                        if (n == d * d)           {k ++;}
+                    }
+                }
+            }
+            System . out . println (n);
+        }
+    }
+}