PAT 1024 Palindromic Number python解法

最新推荐文章于 2021-02-18 10:58:51 发布

D_ry

最新推荐文章于 2021-02-18 10:58:51 发布

阅读量250

点赞数

CC 4.0 BY-SA版权

分类专栏： python

本文链接：https://blog.youkuaiyun.com/qq_36936510/article/details/88078714

python 专栏收录该内容

69 篇文章

订阅专栏

本文介绍了一个算法问题，即如何找到一个非回文数通过特定步骤转换成回文数的方法。文章详细解释了回文数的概念，以及如何通过反转并相加的方式将非回文数转化为回文数，同时给出了具体的输入输出规范和示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1024 Palindromic Number （25 分）
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.

Non-palindromic numbers can be paired with palindromic ones via a series of operations. First, the non-palindromic number is reversed and the result is added to the original number. If the result is not a palindromic number, this is repeated until it gives a palindromic number. For example, if we start from 67, we can obtain a palindromic number in 2 steps: 67 + 76 = 143, and 143 + 341 = 484.

Given any positive integer N, you are supposed to find its paired palindromic number and the number of steps taken to find it.

Input Specification:
Each input file contains one test case. Each case consists of two positive numbers N and K, where N (≤10
10
) is the initial numer and K (≤100) is the maximum number of steps. The numbers are separated by a space.

Output Specification:
For each test case, output two numbers, one in each line. The first number is the paired palindromic number of N, and the second number is the number of steps taken to find the palindromic number. If the palindromic number is not found after K steps, just output the number obtained at the Kth step and K instead.

Sample Input 1:
67 3
Sample Output 1:
484
2
Sample Input 2:
69 3
Sample Output 2:
1353
3

解题思路：简单题，根据题意判断就OK。

n, m = input().split()
i = 0
while i<int(m):
    t = n[::-1]
    if t == n:
        print(t)
        print(i)
        break
    else:
        n = str(int(t)+int(n))
        i += 1
else:
    print(n)
    print(i)