From 8487fe3f219c99dc720f99e2d53197c211deaf5b Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.freedom.nl>
Date: Mon, 31 Jan 2022 15:50:18 +0100
Subject: Week 150: Solutions

---
 challenge-150/abigail/java/ch-1.java | 27 +++++++++++++++++++++++++++
 challenge-150/abigail/java/ch-2.java | 28 ++++++++++++++++++++++++++++
 2 files changed, 55 insertions(+)
 create mode 100644 challenge-150/abigail/java/ch-1.java
 create mode 100644 challenge-150/abigail/java/ch-2.java

(limited to 'challenge-150/abigail/java')

diff --git a/challenge-150/abigail/java/ch-1.java b/challenge-150/abigail/java/ch-1.java
new file mode 100644
index 0000000000..a8d8e34bd8
--- /dev/null
+++ b/challenge-150/abigail/java/ch-1.java
@@ -0,0 +1,27 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+//
+
+//
+// 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 [] fibs = line . trim () . split (" ");
+            String fib_prev = fibs [0];
+            String fib_last = fibs [1];
+            while (fib_last . length () < 51) {
+                String fib_tmp = fib_last;
+                fib_last = fib_prev + fib_last;
+                fib_prev = fib_tmp;
+            }
+            System . out . println (fib_last . substring (50, 51));
+        }
+    }
+}
diff --git a/challenge-150/abigail/java/ch-2.java b/challenge-150/abigail/java/ch-2.java
new file mode 100644
index 0000000000..2f24445028
--- /dev/null
+++ b/challenge-150/abigail/java/ch-2.java
@@ -0,0 +1,28 @@
+//
+// See https://theweeklychallenge.org/blog/perl-weekly-challenge-150
+//
+
+//
+// Run as: ln ch-2.java ch2.java; javac ch2.java; java ch2
+//
+
+import java.util.*;
+
+public class ch2 {
+    public static void main (String [] args) {
+        int [] primes = {2, 3, 5, 7, 11, 13, 17, 19};
+        for (int n = 1; n <= 500; n ++) {
+            boolean has_square = false;
+            for (int p: primes) {
+                if (n % (p * p) == 0) {
+                    has_square = true;
+                    break;
+                }
+            }
+            if (!has_square) {
+                System . out . printf ("%d ", n);
+            }
+        }
+        System . out . printf ("\n");
+    }
+}
-- 
cgit