We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #36: Double-base palindromes
  4. Discussions

Project Euler #36: Double-base palindromes

  • yuvakiran821 + 0 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]