Project Euler #29: Distinct powers

  • + 0 comments

    Easy, really? Two whole days and I haven't managed to find a O(1) solution. Used double memorization and some optimization. Final timing for N=100000 is 0.2 seconds.