From f6f8fa27a551ad1171389cc9ca8b5c9a0e39e025 Mon Sep 17 00:00:00 2001 From: Abigail Date: Tue, 25 Jan 2022 13:09:57 +0100 Subject: Week 149, part 1: More solutions bc, C, Go, Java, Lua, Node.js, Pascal, Python, R, Ruby, Scheme, and Tcl. --- challenge-149/abigail/java/ch-1.java | 58 ++++++++++++++++++++++++++++++++++++ 1 file changed, 58 insertions(+) create mode 100644 challenge-149/abigail/java/ch-1.java (limited to 'challenge-149/abigail/java/ch-1.java') diff --git a/challenge-149/abigail/java/ch-1.java b/challenge-149/abigail/java/ch-1.java new file mode 100644 index 0000000000..feed6ae6ae --- /dev/null +++ b/challenge-149/abigail/java/ch-1.java @@ -0,0 +1,58 @@ +// +// See https://theweeklychallenge.org/blog/perl-weekly-challenge-149 +// + +// +// Run as: ln ch-1.java ch1.java; javac ch1.java; java ch1 < input-file +// + +import java.util.*; +import java.util.Map; + +public class ch1 { + private static int digit_sum (int n) { + int sum = 0; + int base = 10; + while (n > 0) { + sum += n % base; + n = (int) Math . floor (n / base); + } + return (sum); + } + + private static int fib_prev = 0; + private static int fib_last = 1; + private static Map fib = + new Hashtable (); + + private static void fib_init () { + fib . put (fib_prev, true); + fib . put (fib_last, true); + } + + private static boolean is_fib (int n) { + while (fib_last < n) { + int t = fib_last; + fib_last += fib_prev; + fib_prev = t; + fib . put (fib_last, true); + } + return (fib . containsKey (n)); + } + + + public static void main (String [] args) { + fib_init (); + Scanner scanner = new Scanner (System . in); + while (scanner . hasNextInt ()) { + int n = scanner . nextInt (); + for (int k = 0; n > 0; k ++) { + if (is_fib (digit_sum (k))) { + System . out . printf ("%d ", k); + n --; + } + } + System . out . printf ("\n"); + } + } +} -- cgit