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 didn't need to write any functions in python. Just looped over bases 1-9 and exponents 1-21 which yields all the 47 answers by only looping 189 times. And to even further improve performance, I kept a literal with a dictionary with lists for each N.
Project Euler #63: Powerful digit counts
You are viewing a single comment's thread. Return to all comments →
I didn't need to write any functions in python. Just looped over bases 1-9 and exponents 1-21 which yields all the 47 answers by only looping 189 times. And to even further improve performance, I kept a literal with a dictionary with lists for each N.