----------------------------------------------------------------------------------
@MSGID:
<a10a258f-8a3a-4017-bb30-8fe5629089ffn@googlegroups.com> 50f4e1fd
@REPLY: <874jjvmoi9.fsf@bsb.me.uk> c814adf9
@REPLYADDR Francesc Rocher
<francesc.rocher@gmail.com>
@REPLYTO 2:5075/128 Francesc Rocher
@CHRS: CP866 2
@RFC: 1 0
@RFC-References:
<beaa0494-5783-4130-b96f-1a5271466678n@googlegroups.com> <874jjvmoi9.fsf@bsb.me.uk>
@RFC-Message-ID:
<a10a258f-8a3a-4017-bb30-8fe5629089ffn@googlegroups.com>
@TZUTC: -0700
@PID: G2/1.0
@TID: FIDOGATE-5.12-ge4e8b94
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.
https://github.com/rocher/alice-project_euler-rocher/blob/main/src/0001-0100/p00
29_distinct_powers.adb
It`s not using any big numbers library.
---
Francesc Rocher
--- G2/1.0
* Origin: usenet.network (2:5075/128)
SEEN-BY: 5001/100 5005/49 5015/255 5019/40 5020/715
848 1042 4441 12000
SEEN-BY: 5030/49 1081 5058/104 5075/128
@PATH: 5075/128 5020/1042 4441