aboutsummaryrefslogtreecommitdiff
path: root/challenge-091/perlboy1967/perl/ch-2.pl
blob: fb450ace9b8c193ec059b57ce4091b9037d12887 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#!/usr/bin/perl

# Perl Weekly Challenge - 091
# - https://perlweeklychallenge.org/blog/perl-weekly-challenge-091/
#
# Task 2 - Jump Game
#
# Author: Niels 'PerlBoy' van Dijke

use strict;
use warnings;

# Unbuffered STDOUT
$|++;

use Scalar::Util qw(looks_like_number);

@ARGV = (2,123,4,1,2,99,100)
  unless (@ARGV);

my (@N) = @ARGV;

die "Please provide a list with integer number (x >= 0)"
  if (grep { !looks_like_number($_) or $_ < 0 or $_ != int($_) } @N);

printf "Input: (%s)\n\n", join(',', @N);

# Array for progress printing
my (@S) = map { ' ' x length($_) } @N;

my $i = 0;
while ($i < scalar(@N) - 1 and $N[$i] != 0) {
  my $c = ($i + $N[$i] >= scalar(@N) ? '!' : '^');
  printLocation($i, $c);
  $i += $N[$i];
}
printLocation($i, '^') if ($i == scalar(@N) - 1);

print "\n";
printf "Output: %d\n", ($i == scalar(@N) - 1 ? 1 : 0);

sub printLocation {
  my ($i, $c) = @_;

  printf "%s\n", join(' ', @N);
  printf "%s\n", join(' ', 
                      @S[0 .. $i-1], 
                      $c x length($N[$i]), 
                      @S[$i+1 .. -1]);
}