Java solutions for week 137

2 files changed, 76 insertions, 0 deletions

diff --git a/challenge-137/abigail/java/ch-1.java b/challenge-137/abigail/java/ch-1.java
new file mode 100644
index 0000000000..f15167da39
--- /dev/null
+++ b/challenge-137/abigail/java/ch-1.java
@@ -0,0 +1,42 @@
+//
+// See ../README.md
+//
+
+//
+// Run as: ln ch-1.java ch1.java; javac ch1.java; java ch1
+//
+
+import java.util.*;
+
+public class ch1 {
+    static int [] start_years       = {1600, 2000};
+    static int [] long_year_offsets = {
+          4,      9,     15,     20,     26,
+         32,     37,     43,     48,     54,
+         60,     65,     71,     76,     82,
+         88,     93,     99,            
+                105,    111,    116,    122,
+        128,    133,    139,    144,    150,
+        156,    161,    167,    172,    178,
+        184,    189,    195,            
+                201,    207,    212,    218,
+        224,    229,    235,    240,    246,
+        252,    257,    263,    268,    274,
+        280,    285,    291,    296,    
+                        303,    308,    314,
+        320,    325,    331,    336,    342,
+        348,    353,    359,    364,    370,
+        376,    381,    387,    392,    398,
+    };
+
+    public static void main (String [] args) {
+        for (int start_year: start_years) {
+            for (int offset: long_year_offsets) {
+                int year = start_year + offset;
+                if (1900 <= year && year <= 2100) {
+                    System . out . println (year);
+                }
+            }
+        }
+    }
+}
diff --git a/challenge-137/abigail/java/ch-2.java b/challenge-137/abigail/java/ch-2.java
new file mode 100644
index 0000000000..20b8034d2b
--- /dev/null
+++ b/challenge-137/abigail/java/ch-2.java
@@ -0,0 +1,34 @@
+//
+// See ../README.md
+//
+
+//
+// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2 < input-file
+//
+
+import java.util.*;
+
+public class ch2 {
+    static int reverse (int num) {
+        int rev = 0;
+        while (num > 0) {
+            rev *= 10;
+            rev += num % 10;
+            num /= 10;
+        }
+        return (rev);
+    }
+
+    static int ly (int n) {
+        return n >= 10000000    ? 1
+             : n == reverse (n) ? 0
+             : ly (n + reverse (n));
+    }
+
+    public static void main (String [] args) {
+        Scanner scanner = new Scanner (System . in);
+        while (scanner . hasNextInt ()) {
+            System . out . println (ly (scanner . nextInt ()));
+        }
+    }
+}