PWC150 - Fibonacci Words


Here we are with TASK #1 from The Weekly Challenge #150. Enjoy!

The challenge

You are given two strings having same number of digits, $a and $b.

Write a script to generate Fibonacci Words by concatenation of the previous two strings. Finally print 51st digit of the first term having at least 51 digits.


Input: $a = '1234' $b = '5678'
Output: 7

Fibonacci Words:


The 51st digit in the first term having at least 51 digits '1234567856781234567856781234567812345678567812345678' is 7. 

The questions

This challenge made me scratch my head because it’s easy to infer what the generation algorithm should be (join consecutive elements as strings instead of summing them), and yet I can’t find any reference to this elsewhere. Well, I mean in the first few results from DuckDuckGo.

Whatever, I’ll go for the string joining approach.

The solution

So, let’s go Raku first. There is a particular itch to scratch here, in that the first two items to produce aren’t actually manufactured, so I spent a bit of time to think about how to deal with this special case.

I can’t say my solution is particularly clever: member variable $!backlog keeps track of how many items from this “backlog” we still have to give out, and when this hits 0 we start producing new items.

#!/usr/bin/env raku
use v6;

class FibonacciWords { ... };

sub MAIN (Int:D $a, Int:D $b where $b.Str.chars == $a.Str.chars) {
   my $it =$a, $b);
   put "Fibonacci Words\n";
   loop {
      my $item = $;
      put "'$item'";
      if $item.chars >= 51 {
         my $digit = $item.substr(50, 1);
         put "\nThe 51st digit in the first term having at least 51 digits '$item' is $digit.";

class FibonacciWords {
   has $!f0 is built;
   has $!f1 is built;
   has $!backlog = 2;
   method new (Str() $f0, Str() $f1) { self.bless(:$f0, :$f1) }
   method next () {
      if ! $!backlog {
         ($!f0, $!f1) = ($!f1, $!f0 ~ $!f1);
         return $!f1;
      return $!backlog ?? $!f0 !! $!f1;

Using a class is… how to say… totally overkill, but that’s how it is!

The Perl version transforms the object into an iterator sub reference. I so love iterators. And yes, it’s still overkill.

#!/usr/bin/env perl
use 5.024;
use warnings;
use English qw< -no_match_vars >;
use experimental qw< postderef signatures >;
no warnings qw< experimental::postderef experimental::signatures >;

say "Fibonacci Words:\n";
my $it = fibonacci_words_iterator(@ARGV);
while ('necessary') {
   my $item = $it->();
   say "'$item'";
   if (length $item >= 51) {
      my $digit = substr $item, 50, 1;
      say "\nThe 51st digit in the first term having at least 51 digits '$item' is $digit.";

sub fibonacci_words_iterator ($f0, $f1) {
   my @cache = ('', '', $f0, $f1);
   my $backlog = 2;
   return sub {
      if (! $backlog) {
         ($f0, $f1) = ($f1, $f0 . $f1);
         return $f1;
      return $backlog ? $f0 : $f1;

Stay safe folks!

Comments? Octodon, , GitHub, Reddit, or drop me a line!