Created
December 19, 2018 10:42
-
-
Save amritghimire/8fb62dc7b697e442e3e582668348cdde to your computer and use it in GitHub Desktop.
Solution to Question 3 of i-CES Coding Competition
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
f = lambda n:sorted(str(n)) | |
n = 99999 | |
while not f(n*2) == f(n*3) == f(n*4) == f(n*5) == f(n*6): n += 9 | |
print(n) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment