Java solution for week 112, part 2

2 files changed, 25 insertions, 0 deletions

diff --git a/challenge-112/abigail/README.md b/challenge-112/abigail/README.md
index aba06c6afa..ebfd5aa08f 100644
--- a/challenge-112/abigail/README.md
+++ b/challenge-112/abigail/README.md
@@ -60,6 +60,7 @@ This is just finding the `$n + 1` Fibonacci number.
 * [Bash](bash/ch-2.sh)
 * [C](c/ch-2.c)
 * [Go](go/ch-2.go)
+* [Java](java/ch-2.java)
 * [Lua](lua/ch-2.lua)
 * [Node.js](node/ch-2.js)
 * [Perl](perl/ch-2.pl)
diff --git a/challenge-112/abigail/java/ch-2.java b/challenge-112/abigail/java/ch-2.java
new file mode 100644
index 0000000000..b1db2db642
--- /dev/null
+++ b/challenge-112/abigail/java/ch-2.java
@@ -0,0 +1,24 @@
+//
+// See ../README.md
+//
+
+//
+// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2 < input-file
+//
+
+import java.util.Scanner;
+import java.lang.Math;
+
+
+public class ch2 {
+    public static void main (String [] args) {
+        final double SQRT5 = Math . sqrt (5);
+        final double PHI   = (1 + SQRT5) / 2;
+        Scanner scanner = new Scanner (System . in);
+        while (scanner . hasNextInt ()) {
+            System . out . printf ("%d\n",
+                (int) Math . round (
+                      Math . pow (PHI, scanner . nextInt () + 1) / SQRT5));
+        }
+    }
+}