You are viewing a single comment's thread. Return to all comments →
hope this may useful ( for 1<=k<=9 )
def anymode(n,k): s='' while n: n,r=divmod(n,k) s+=str(r) return s[::-1]
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #36: Double-base palindromes
You are viewing a single comment's thread. Return to all comments →
hope this may useful ( for 1<=k<=9 )