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
|
#!/usr/bin/perl
use strict;
use warnings;
use List::Util 1.54 qw(sample);
my $K = $ARGV[0];
die "ERROR: Missing non-negative number (k).\n" unless defined $K;
die "ERROR: Invalid k received [$K].\n" unless $K > 0;
my $S = 10;
my @L = sort { $b <=> $a } sample ($S, (1 .. 50));
print sprintf("\@L: [%s]\n", join(", ", @L));
my $matched = find_match($K, @L);
(@$matched)
?
(print join("\n", @$matched), "\n")
:
(print "Oops, none matched.\n");
sub find_match {
my ($K, @L) = @_;
my $S = scalar(@L);
my $matched = [];
foreach my $i (0 .. --$S) {
foreach my $j ($i+1 .. $S) {
my $k = $L[$i] - $L[$j];
if ($k == $K) {
push @$matched, sprintf("%2s,%2s => (%2s - %2s) => %d", $i, $j, $L[$i], $L[$j], $k);
}
}
}
return $matched;
}
|
