You are viewing a single comment's thread. Return to all comments →
There are only 44 combinations of 3 unique numbers (0-9) that are divisable by 17.
The problem has very lax requirements, but for N=9, you can do this in 2 ms using Python 3.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #43: Sub-string divisibility
You are viewing a single comment's thread. Return to all comments →
There are only 44 combinations of 3 unique numbers (0-9) that are divisable by 17.
The problem has very lax requirements, but for N=9, you can do this in 2 ms using Python 3.