浙江大学PAT_甲级_1024. Palindromic Number (25)

最新推荐文章于 2023-12-28 11:32:39 发布

原创最新推荐文章于 2023-12-28 11:32:39 发布 · 483 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#浙江大学 #PAT #python #数据结构

PAT甲级专栏收录该内容

38 篇文章

订阅专栏

本文介绍了一种算法，用于找到任意正整数N的配对回文数及其所需步骤。回文数是指正读反读都一样的数字，文中详细说明了如何通过一系列操作将非回文数转换为回文数的过程。

题目链接：点击打开链接

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¹⁰) 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

回文数

python程序：

def check(str):
    left=int(0)
    right=len(str)-1
    while left<=right:
        if str[left]!=str[right]:
            return 0
        left=left+1
        right=right-1;
    return 1
a=[int(i) for i in raw_input().split()]
n=str(a[0])
k=int(a[1])
temp_int=0
count_k=0
for i in range(1,k+1):
    if check(n):
        break;
    temp_str=n[::-1]
    temp_int=int(n)+int(temp_str)
    n=str(temp_int)
    count_k=count_k+1
print n
print count_k