|
|
>>> .....1,549,498,368
>>
>> I recognise those last 6 digits! I think I got them from my program, but
>> then my method was too slow to do any more digits in reasonable time.
>>
>
> It's interesting that you had an algorithm that could compute six digits
> but not ten.
Well I simplified as far as Invisible did, and then didn't go through the
modular math to simplifiy it, just applied the mod operator at various
points in the code. Using mod 1e5 took a fraction of a second, mod 1e6 took
about 10 seconds, and mod 1e7 never finished!
> You might try running it on the second version of the puzzle that I gave,
> since I only ask for the last five digits in that case. Maybe it'll work!
Hmmm.
Post a reply to this message
|
|