Project Euler #36: Double-base palindromes

  • + 1 comment

    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]