From e2eda480de8760ea8c3b40e253d6c5d4dddfd73a Mon Sep 17 00:00:00 2001 From: Luis Mochan Date: Mon, 1 Jul 2024 09:27:03 -0600 Subject: Solve PWC276 --- challenge-276/wlmb/blog.txt | 1 + challenge-276/wlmb/perl/ch-1.pl | 16 ++++++++++++++++ challenge-276/wlmb/perl/ch-2.pl | 6 ++++++ 3 files changed, 23 insertions(+) create mode 100644 challenge-276/wlmb/blog.txt create mode 100755 challenge-276/wlmb/perl/ch-1.pl create mode 100755 challenge-276/wlmb/perl/ch-2.pl diff --git a/challenge-276/wlmb/blog.txt b/challenge-276/wlmb/blog.txt new file mode 100644 index 0000000000..1f5c8a58ce --- /dev/null +++ b/challenge-276/wlmb/blog.txt @@ -0,0 +1 @@ +https://wlmb.github.io/2024/07/01/PWC276/ diff --git a/challenge-276/wlmb/perl/ch-1.pl b/challenge-276/wlmb/perl/ch-1.pl new file mode 100755 index 0000000000..036636dfad --- /dev/null +++ b/challenge-276/wlmb/perl/ch-1.pl @@ -0,0 +1,16 @@ +#!/usr/bin/env perl +# Perl weekly challenge 276 +# Task 1: Complete Day +# +# See https://wlmb.github.io/2024/07/01/PWC276/#task-1-complete-day +use v5.36; +die <<~"FIN" unless @ARGV; + Usage: $0 H1 H2... + to find how many pairs of hours H1, H2... add up to complete days. + FIN +my @counts; +$counts[$_%24]++ for @ARGV; +my $Npairs; +$Npairs += ($counts[$_]//0)*($counts[(-$_)%24]//0) for 1..11; +$Npairs += ($counts[$_]//0)*(($counts[$_]//0)-1)/2 for(0,12); +say "@ARGV -> $Npairs"; diff --git a/challenge-276/wlmb/perl/ch-2.pl b/challenge-276/wlmb/perl/ch-2.pl new file mode 100755 index 0000000000..9744b92557 --- /dev/null +++ b/challenge-276/wlmb/perl/ch-2.pl @@ -0,0 +1,6 @@ +#!/usr/bin/env perl +# Perl weekly challenge 276 +# Task 2: Maximum Frequency +# +# See https://wlmb.github.io/2024/07/01/PWC276/#task-2-maximum-frequency +use v5.36; -- cgit