Project Euler Problem 55： Lychrel numbers【暴力】

PE其他解题报告请参考这里,本题答案在留言首条

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?

NOTE: Wording was modified slightly on 24 April 2007 to emphasise the theoretical nature of Lychrel numbers.

---

题意：

首先定义什么叫Lychrel numbers,一个数x就是说可以在50次循环内，x + rev(x) 为回文数，该数就不是Lychrel numbers，其中rev(x)定义为x的翻转数，rev(123) = 321，这种的，问你[1,10000]内有多少个Lychrel numbers。

分析：

暴力做就行，范围很小，python方便一点

参考代码

def check(num):
    cnt = 0
    while (cnt < 50):
        rev = str(num)[::-1]
        num = int(num + int(rev))
        cnt += 1
        l, r = 0, len(str(num)) - 1
        flg = 0
        while (l < r):
            if (str(num)[l] != str(num)[r]):
                flg = 1
                break
            l += 1
            r -= 1
        if not flg:
            return 1
    return 0
cnt = 0
for i in range(1, 10001):
    if not (check(i)) :
        cnt += 1
print(cnt)

阅读好习惯：点赞 + 收藏~