Solutions for week 139

2 files changed, 70 insertions, 0 deletions

diff --git a/challenge-139/abigail/java/ch-1.java b/challenge-139/abigail/java/ch-1.java
new file mode 100644
index 0000000000..e5a102cb12
--- /dev/null
+++ b/challenge-139/abigail/java/ch-1.java
@@ -0,0 +1,25 @@
+//
+// 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 [] list = line . split (" ");
+            boolean sorted = true;
+            for (int i = 1; sorted && i < list . length; i ++) {
+                sorted = Integer . parseInt (list [i - 1]) <=
+                         Integer . parseInt (list [i]);
+            }
+            System . out . println (sorted ? 1 : 0);
+        }
+    }
+}
diff --git a/challenge-139/abigail/java/ch-2.java b/challenge-139/abigail/java/ch-2.java
new file mode 100644
index 0000000000..a7f1c2715f
--- /dev/null
+++ b/challenge-139/abigail/java/ch-2.java
@@ -0,0 +1,45 @@
+//
+// See ../README.md
+//
+
+//
+// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2
+//
+
+import java.util.*;
+
+public class ch2 {
+    public static final int BASE  = 10;
+    public static final int COUNT =  5;
+
+    public static boolean is_long (int number) {
+        boolean [] seen = new boolean [number];
+        for (int i = 0; i < number; i ++) {
+            seen [i] = false;
+        }
+        int rest = 0;
+        for (int i = 2; i <= number; i ++) {
+            rest = (rest * BASE + BASE - 1) % number;
+            if (seen [rest]) {
+                return false;
+            }
+            seen [rest] = true;
+        }
+        return true;
+    }
+
+    public static void main (String [] args) {
+        int number = 1;
+        int count  = COUNT;
+        while (count > 0) {
+            number ++;
+            if (BASE % number == 0) {
+                continue;
+            }
+            if (is_long (number)) {
+                System . out . println (number);
+                count --;
+            }
+        }
+    }
+}