From mboxrd@z Thu Jan 1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on
ip-172-31-65-14.ec2.internal
X-Spam-Level:
X-Spam-Status: No, score=-0.0 required=3.0 tests=BAYES_40,FREEMAIL_FROM,
T_SCC_BODY_TEXT_LINE autolearn=ham autolearn_force=no version=3.4.6
X-Received: by 2002:a05:620a:8b86:b0:76f:130a:c957 with SMTP id qx6-20020a05620a8b8600b0076f130ac957mr136182qkn.11.1694976991172;
Sun, 17 Sep 2023 11:56:31 -0700 (PDT)
X-Received: by 2002:a05:6808:3089:b0:3a7:5742:ce92 with SMTP id
bl9-20020a056808308900b003a75742ce92mr3270283oib.0.1694976990828; Sun, 17 Sep
2023 11:56:30 -0700 (PDT)
Path: eternal-september.org!news.eternal-september.org!border-1.nntp.ord.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Sun, 17 Sep 2023 11:56:30 -0700 (PDT)
In-Reply-To: <87jzsplr49.fsf@bsb.me.uk>
Injection-Info: google-groups.googlegroups.com; posting-host=77.75.179.3; posting-account=ZswU3AoAAAA4QKiyoxEpA3Hh7ry7Cau3
NNTP-Posting-Host: 77.75.179.3
References:
<874jjvmoi9.fsf@bsb.me.uk>
<87sf7dltq0.fsf@bsb.me.uk> <87jzsplr49.fsf@bsb.me.uk>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <715fe49a-47bc-46be-ae26-9ed89b38bcb5n@googlegroups.com>
Subject: Re: project euler 29
From: Francesc Rocher
Injection-Date: Sun, 17 Sep 2023 18:56:31 +0000
Content-Type: text/plain; charset="UTF-8"
Xref: news.eternal-september.org comp.lang.ada:65669
List-Id:
El dia dissabte, 16 de setembre de 2023 a les 23:56:11 UTC+2, Ben Bacarisse va escriure:
> Ben Bacarisse writes:
>
> > Francesc Rocher writes:
> >
> >> El dia divendres, 15 de setembre de 2023 a les 17:42:43 UTC+2, Ben Bacarisse va escriure:
> >>> "CSYH (QAQ)" writes:
> >>>
> >>> > Now this time, I am facing trouble for problem #29. As I know integer
> >>> > type is for 32 bits. but for this problem as me to find out the 2 **
> >>> > 100 and even 100 ** 100. I used python to get the answer correctly in
> >>> > 5 minutes.
> >>
> >>> Most of the Project Euler problems have solutions that are not always
> >>> the obvious one (though sometimes the obvious one is the best). You
> >>> can, of course, just use a big number type (or write your own!) but this
> >>> problem can be solved without having to use any large numbers at all.
> >>
> >> Please take a look at this solution:
> >> https://github.com/rocher/alice-project_euler-rocher/blob/main/src/0001-0100/p0029_distinct_powers.adb
> >
> > Why?
> That came over as rather curt. I meant what is it about the code that
> you are drawing my attention to -- its particular use of Ada, its
> structure, the algorithm, the performance...? What (and where) is
> Euler_Tools?
Well, I was sending the answer to the thread, not to anyone in particular.
I simply thought that, since you mention that this can be solved without having to use
big numbers, people in this group could be interested in seeing how. My solution to this
problem dates back to earlier this year, when I solved the first 30 problems of Project
Euler.
Euler_Tools is a repository of functions that I'm collecting while solving new problems
of Project Euler. In case you want to take a look, https://github.com/rocher/euler_tools
Also, do you have a different approach to solve this 29th problem?
BR
---
Francesc Rocher