Matt Owen

source code for "files/pe/pe_018.pl"

return to portfolio
  1.  #!/usr/bin/perl
  2.  
  3.  use strict;
  4.  use warnings;
  5.  use grid;
  6.  
  7.  my $s;
  8.  
  9.  $s = "75
  10.  95 64
  11.  17 47 82
  12.  18 35 87 10
  13.  20 04 82 47 65
  14.  19 01 23 75 03 34
  15.  88 02 77 73 07 63 67
  16.  99 65 04 28 06 16 70 92
  17.  41 41 26 56 83 40 80 70 33
  18.  41 48 72 33 47 32 37 16 94 29
  19.  53 71 44 65 25 43 91 52 97 51 14
  20.  70 11 33 28 77 73 17 78 39 68 17 57
  21.  91 71 52 38 17 14 91 43 58 50 27 29 48
  22.  63 66 04 68 89 53 67 30 73 16 69 87 40 31
  23.  04 62 98 27 23 09 70 98 73 93 38 53 60 04 23";
  24.  
  25.  my @tri = split(/\s/, $s);
  26.  my $g = new grid(20, 20, 0);
  27.  
  28.  my $count = 0;
  29.  my $k = 0;
  30.  my $holder = 0;
  31.  
  32.  sub solve_grid {
  33.   my $g = shift;
  34.   my ($h, $w) = ($g->get_height(), $g->get_width());
  35.   my ($k, $v, $l, $r);
  36.  
  37.   for ($h-=2; $h+1; $h--) {
  38.   for $k (0..$w-1) {
  39.   $v = $g->get($k, $h);
  40.   $l = $g->get($k, $h+1);
  41.   $r = $g->get($k+1, $h+1);
  42.   $g->set($k, $h, $v+$l) if $l > $r;
  43.   $g->set($k, $h, $v+$r) if $l <= $r;
  44.   }
  45.   }
  46.  }
  47.  
  48.  while (@tri) {
  49.   for $k (0..$count) {
  50.   $holder = shift @tri;
  51.   $g->set($k, $count, $holder);
  52.   last if not @tri;
  53.   }
  54.   $count++;
  55.  }
  56.  
  57.  solve_grid $g;
  58.  
  59.  print $g->get(0,0);