"""
Lychrel numbers
Problem 55

If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
Not all numbers produce palindromes so quickly. For example,

349 + 943 = 1292,
1292 + 2921 = 4213
4213 + 3124 = 7337

That is, 349 took three iterations to arrive at a palindrome.

Although no one has proved it yet, it is thought that some numbers,
like 196, never produce a palindrome. A number that never forms a
palindrome through the reverse and add process is called a Lychrel
number. Due to the theoretical nature of these numbers, and for the
purpose of this problem, we shall assume that a number is Lychrel
until proven otherwise. In addition you are given that for every
number below ten-thousand, it will either (i) become a palindrome
in less than fifty iterations, or, (ii) no one, with all the
computing power that exists, has managed so far to map it to a
palindrome. In fact, 10677 is the first number to be shown to
require over fifty iterations before producing a palindrome:
4668731596684224866951378664 (53 iterations, 28-digits).

Surprisingly, there are palindromic numbers that are themselves
Lychrel numbers; the first example is 4994.

How many Lychrel numbers are there below ten-thousand?
"""


def isPalindrome(n):
    n = str(n)
    nn = ''.join(reversed(n))
    if n == nn:
        return True
    else:
        return False


def _rN(a):
    # reverse a number
    rn = ''.join(reversed(str(a)))
    return int(rn)


d = {n: False for n in range(1, 10001)}
lychrelNumber = 0

for key, _ in list(sorted(d.items())):
    keyB = key
    r = key + _rN(key)

    counter = 49
    while not isPalindrome(r) and counter > 0:
        key = r
        r = key + _rN(key)
        #print("   ", key, _rN(key), r, isPalindrome(r), "counter: ", counter)
        counter -= 1
    else:
        if isPalindrome(r):
            pass
        elif not isPalindrome(r):
            lychrelNumber += 1
            #print("Lychrel-Number: ", keyB)
        else:
            print("NEVERMIND!")

print("Lychrel-Numbers total: ", lychrelNumber)

7b9b693490a4a91e14896cd512f507e99057cad6
<mask token>

<mask token>


def isPalindrome(n):
    n = str(n)
    nn = ''.join(reversed(n))
    if n == nn:
        return True
    else:
        return False


def _rN(a):
    rn = ''.join(reversed(str(a)))
    return int(rn)


<mask token>

<mask token>


def isPalindrome(n):
    n = str(n)
    nn = ''.join(reversed(n))
    if n == nn:
        return True
    else:
        return False


def _rN(a):
    rn = ''.join(reversed(str(a)))
    return int(rn)


<mask token>
for key, _ in list(sorted(d.items())):
    keyB = key
    r = key + _rN(key)
    counter = 49
    while not isPalindrome(r) and counter > 0:
        key = r
        r = key + _rN(key)
        counter -= 1
    else:
        if isPalindrome(r):
            pass
        elif not isPalindrome(r):
            lychrelNumber += 1
        else:
            print('NEVERMIND!')
print('Lychrel-Numbers total: ', lychrelNumber)

<mask token>


def isPalindrome(n):
    n = str(n)
    nn = ''.join(reversed(n))
    if n == nn:
        return True
    else:
        return False


def _rN(a):
    rn = ''.join(reversed(str(a)))
    return int(rn)


d = {n: (False) for n in range(1, 10001)}
lychrelNumber = 0
for key, _ in list(sorted(d.items())):
    keyB = key
    r = key + _rN(key)
    counter = 49
    while not isPalindrome(r) and counter > 0:
        key = r
        r = key + _rN(key)
        counter -= 1
    else:
        if isPalindrome(r):
            pass
        elif not isPalindrome(r):
            lychrelNumber += 1
        else:
            print('NEVERMIND!')
print('Lychrel-Numbers total: ', lychrelNumber)

"""
Lychrel numbers
Problem 55

If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
Not all numbers produce palindromes so quickly. For example,

349 + 943 = 1292,
1292 + 2921 = 4213
4213 + 3124 = 7337

That is, 349 took three iterations to arrive at a palindrome.

Although no one has proved it yet, it is thought that some numbers,
like 196, never produce a palindrome. A number that never forms a
palindrome through the reverse and add process is called a Lychrel
number. Due to the theoretical nature of these numbers, and for the
purpose of this problem, we shall assume that a number is Lychrel
until proven otherwise. In addition you are given that for every
number below ten-thousand, it will either (i) become a palindrome
in less than fifty iterations, or, (ii) no one, with all the
computing power that exists, has managed so far to map it to a
palindrome. In fact, 10677 is the first number to be shown to
require over fifty iterations before producing a palindrome:
4668731596684224866951378664 (53 iterations, 28-digits).

Surprisingly, there are palindromic numbers that are themselves
Lychrel numbers; the first example is 4994.

How many Lychrel numbers are there below ten-thousand?
"""


def isPalindrome(n):
    n = str(n)
    nn = ''.join(reversed(n))
    if n == nn:
        return True
    else:
        return False


def _rN(a):
    # reverse a number
    rn = ''.join(reversed(str(a)))
    return int(rn)


d = {n: False for n in range(1, 10001)}
lychrelNumber = 0

for key, _ in list(sorted(d.items())):
    keyB = key
    r = key + _rN(key)

    counter = 49
    while not isPalindrome(r) and counter > 0:
        key = r
        r = key + _rN(key)
        #print("   ", key, _rN(key), r, isPalindrome(r), "counter: ", counter)
        counter -= 1
    else:
        if isPalindrome(r):
            pass
        elif not isPalindrome(r):
            lychrelNumber += 1
            #print("Lychrel-Number: ", keyB)
        else:
            print("NEVERMIND!")

print("Lychrel-Numbers total: ", lychrelNumber)
