Re: project euler 29

[Ben Bacarisse <ben.usenet@bsb.me.uk>]

Ben Bacarisse <ben.usenet@bsb.me.uk> writes:

> Francesc Rocher <francesc.rocher@gmail.com> writes:
>
>> El dia divendres, 15 de setembre de 2023 a les 17:42:43 UTC+2, Ben Bacarisse va escriure:
>>> "CSYH (QAQ)" <sche...@asu.edu> 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?

-- 
Ben.