Recognizing when two arithmetic expressions are essentially the same

Re:Recognizing when two arithmetic expressions are essential... by gordaco on Tuesday August 22, 2017 @03:50PM (#15075763)

This would have been very useful solving Project Euler's problem 93: https://projecteuler.net/problem=93.

[ Parent | on HN ]

Re:Recognizing when two arithmetic expressions are essential... by jjaredsimpson on Tuesday August 22, 2017 @04:07PM (#15075930)

That problem is small enough to just brute force. There are only 1612800 calculations to do.

[ Parent | on HN ]

Re:Recognizing when two arithmetic expressions are essential... by gordaco on Tuesday August 22, 2017 @05:31PM (#15076568)

Of course... but for many people, in Project Euler the goal is not just to get a solution, it's to create a beautiful and/or efficient solution. This is why reading the comments and finding other people's solutions after solving a problem is usually as fulfilling as solving it, or even more.

[ Parent | on HN ]

Re:Recognizing when two arithmetic expressions are essential... by jjaredsimpson on Wednesday August 23, 2017 @04:50PM (#15084979)

For sure, only commenting that for that particular problem, brute force is viable. For many problems brute force is not viable.

I was grinding PE a couple years ago to pick up Haskell.

[ Parent | on HN ]