- Updated solution by Ulrich Rieke.

1 files changed, 6 insertions, 7 deletions

diff --git a/challenge-054/ulrich-rieke/raku/ch-2.p6 b/challenge-054/ulrich-rieke/raku/ch-2.p6
index e0133c25ff..8858ec970d 100644
--- a/challenge-054/ulrich-rieke/raku/ch-2.p6
+++ b/challenge-054/ulrich-rieke/raku/ch-2.p6
@@ -5,10 +5,10 @@ sub findSequence( Int $n is copy ) {
   while ( $n != 1 ) {
       @sequence.push( $n ) ;
       if ( $n %% 2 ) {
-    $n div= 2 ;
+        $n div= 2 ;
       }
       else {
-    $n = $n * 3 + 1 ;
+        $n = $n * 3 + 1 ;
       }
   }
   @sequence.push( $n ) ;
@@ -20,10 +20,9 @@ sub MAIN( Int $n ) {
   my @sequences ;
   for (1..1000000) -> $num {
       my @sequence = findSequence( $num ) ;
-      @sequences.push( ($num , @sequence ) ) ;
-      say "$num , {@sequence.elems} " ;
+      @sequences.push( ($num , @sequence.elems ) ) ;
   }
-  my @sorted = @sequences.sort( { $^b[1].elems <=> $^a[1].elems } ) ;
-  say "The sequence length of the longest sequences up to 1000000 is :" ;
-  @sorted[0..19].map( { say "$_[0]  $_[1].elems" } ) ;
+  my @sorted = @sequences.sort( { $^b[1] <=> $^a[1] } ) ;
+  say "The sequence lengths of the longest sequences up to 1000000 are :" ;
+  @sorted[0..19].map( { say "$_[0]  $_[1]" } ) ;
 }