Re: project euler 29

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

"CSYH (QAQ)" <schen309@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.
>
> context = []
> for a in range(2,101):
>     for b in range(2,101):
>         context.append(a**b)
> len(list(set(context)))
>
> I know the algorithm is easy, but I am pretty interesting how to
> calculate a large like it.

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.

-- 
Ben.