codility/1-binary_gap.pl

37 lines
714 B
Perl
Raw Permalink Normal View History

2023-09-20 21:50:08 -05:00
#!/usr/bin/env perl
use strict;
use warnings;
use FindBin;
use lib "$FindBin::RealBin/lib";
use lib 'lib';
use BinaryGap;
my $number = $ARGV[0];
2023-09-21 15:35:43 -05:00
if (scalar(@ARGV) != 1) {
die "Usage: $0 <integer>\n";
}
2023-09-20 21:50:08 -05:00
my $answer = BinaryGap::solution($number);
2023-09-21 15:35:43 -05:00
print "The binary gap of $number is $answer\n";
exit;
__END__
=pod
=encoding utf8
=head1 NAME
binary_gap.pl - Find longest sequence of zeros in binary representation of an integer. Script used to call BinaryGap.
=head1 SYNOPSIS
binary_gap.pl <integer>
=head1 DESCRIPTION
2023-09-20 21:50:08 -05:00
2023-09-21 15:35:43 -05:00
This script is used to exercise BinaryGap.pm. It takes one integer as input. It returns the binary gap (longest sequence of zeros) in the binary representation of the input number.