One million is good round number 🙂 Your task for the weekend challenge is to write code which check if you can find two numbers X and Y which product makes exactly 1 000 000, the catch is that none of these numbers should contain 0 inside it.
How fast is your code?
You can code the solution in any programming language during the weekend and have to submit it to firstname.lastname@example.org latest on Sunday July 27th.
On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC
You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.