From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on ip-172-31-74-118.ec2.internal X-Spam-Level: X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.5-pre1 Path: eternal-september.org!reader02.eternal-september.org!aioe.org!pBWEO6hi52oGFheO/GY5ag.user.gioia.aioe.org.POSTED!not-for-mail From: Stephen Leake Newsgroups: comp.lang.ada Subject: advent of code day 10 Date: Thu, 10 Dec 2020 19:39:33 -0800 Organization: Aioe.org NNTP Server Message-ID: <865z59c8p6.fsf@stephe-leake.org> NNTP-Posting-Host: pBWEO6hi52oGFheO/GY5ag.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain X-Complaints-To: abuse@aioe.org User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/27.1 (windows-nt) X-Notice: Filtered by postfilter v. 0.9.2 Cancel-Lock: sha1:uLTMf1fXgH2YXfBEFDeMii3Avh4= Xref: reader02.eternal-september.org comp.lang.ada:60796 List-Id: This was a more interesting puzzle. It is almost "sort, find consecutive skips, multiply by n choose k", but not quite. I cheated; the final total is larger than 64 bits, so I just printed out the factors and used Emacs built-in bignums to compute it. I assume there is an Ada bignums package out there, and the compiler has one that full Ada 2020 will expose, but I'm trying to catch up, so did not look. -- -- Stephe