We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I still don't think the currrent limit works for python solutions. I dont want to have to resort to using OEIS... I have optimised in every way. Using a set, making use of a map, counting only greater than one values to reduce the times it goes in the loop. I am out of ideas except OEIS
Project Euler #155: Counting Capacitor Circuits.
You are viewing a single comment's thread. Return to all comments →
I still don't think the currrent limit works for python solutions. I dont want to have to resort to using OEIS... I have optimised in every way. Using a set, making use of a map, counting only greater than one values to reduce the times it goes in the loop. I am out of ideas except OEIS
I'm trying to solve it with python3 too, got timeout beginning at 13. didn't get your last move on the optimization, mind elaborating?
There is a way to optimise by only counting half the elements.. since a and 1/a belong to the set.
Python (2/3) gets terminated due to timeout.