Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

comment on

( #3333=superdoc: print w/replies, xml ) Need Help??

A recursive solution:

use strict; use warnings; my $n = shift; my $count = 1; my @matrix; push @matrix, [(0)] for (1..$n); buildRing (0, $n - 1); my $width = length sprintf ("%s", '' . $count); my $format = "%${width}d"; print "" . (join " ", map {sprintf $format, $_} @{$matrix[$_]}) . "\n" + for (0..($n-1)); sub buildRing { my ($first, $last) = @_; $matrix[$first][$_] = $count++ for ($first..$last); $matrix[$_][$last] = $count++ for (($first+1)..$last); $matrix[$last][$last-$_+$first-1] = $count++ for ($first..$last-1); for ($_ = --$last; $_ > $first; --$_) {$matrix[$_][$first] = $count++} $matrix[$first][$last] = $count if (++$first == $last); buildRing ($first, $last) if ($first<$last); }
use strict; use warnings; my $n = shift || 5; my ($count, $first, $last) = (1, 0, $n - 1); my @matrix; push @matrix, [(0)] for (1..$n); { $matrix[$first][$_] = $count++ for ($first..$last); $matrix[$_][$last] = $count++ for (($first+1)..$last); $matrix[$last][$last-$_+$first-1] = $count++ for ($first..$last-1); for ($_ = --$last; $_ > $first; --$_) {$matrix[$_][$first] = $count++} $matrix[$first][$last] = $count if (++$first == $last); redo unless $first >= $last; } my $width = (int log $count) - 1; print "" . (join " ", map {sprintf "%${width}d", $_} @{$matrix[$_]}) . + "\n" for (0..($n-1));
$n=shift;($c,$f,$l,@m)=(1,0,--$n); {$m[$f][$_]=$c++for($f..$l);$m[$_][$l]=$c++for($f+1..$l); $m[$l][$l-$_+$f-1]=$c++for($f..$l-1);for($_=--$l;$_>$f;--$_){$m[$_][$f +]=$c++} $m[$f][$l]=$c if(++$f==$l);redo unless$f>$l}my$w=(int log$c); print"".(join"",map{sprintf"%${w}d",$_}@{$m[$_]})."\n"for(0..$n)
Update: added (smaller) non-recursive version and golf version

Perl is Huffman encoded by design.

In reply to Re: Spiraling integers by GrandFather
in thread Spiraling integers by Elijah

Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":

  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?

    What's my password?
    Create A New User
    and the web crawler heard nothing...

    How do I use this? | Other CB clients
    Other Users?
    Others musing on the Monastery: (5)
    As of 2019-10-23 00:25 GMT
    Find Nodes?
      Voting Booth?