search

nayuki / Project-Euler-solutions

Runnable code for solving Project Euler problems in Java, Python, Mathematica, Haskell.
https://www.nayuki.io/page/project-euler-solutions
1.89k stars 675 forks source link

Update p032.py #52

Closed AlkisPis closed 3 years ago

AlkisPis commented 3 years ago

I have proposed a solution that I thought it was more correct, but from what I understood a little later, I had misinterpreted the problem. I took it as finding ALL pandigital products from 1 to 9, whatever their size. But then I reconsidered the phrase "1 through 9" and I understood that ALL digits 1-9 must be included. So please, delete my proposition and solution!

AlkisPis commented 3 years ago

I have proposed a solution that I thought it was more correct, but from what I understood a little later, I had misinterpreted the problem. I took it as finding ALL pandigital products from 1 to 9, whatever their size. But then I reconsidered the phrase "1 through 9" and I understood that ALL digits 1-9 must be included. So please, delete my proposition and solution! (I don't know how and if I can do that myself.)