1136 A Delayed Palindrome（JAVA）

最新推荐文章于 2022-11-25 12:23:37 发布

快活书生

最新推荐文章于 2022-11-25 12:23:37 发布

阅读量250

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/qq_39557517/article/details/81842321

版权

PAT甲级专栏收录该内容

31 篇文章 0 订阅

订阅专栏

1136 A Delayed Palindrome（20 分）

Consider a positive integer N written in standard notation with k+1 digits ai as ak⋯a1a0 with 0≤ai<10 for all i and ak>0. Then N is palindromic if and only if ai=ak−i for all i. Zero is written 0 and is also palindromic by definition.

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. Such number is called a delayed palindrome. (Quoted from https://en.wikipedia.org/wiki/Palindromic_number )

Given any positive integer, you are supposed to find its paired palindromic number.
Input Specification:

Each input file contains one test case which gives a positive integer no more than 1000 digits.
Output Specification:

For each test case, print line by line the process of finding the palindromic number. The format of each line is the following:

A + B = C

where A is the original number, B is the reversed A, and C is their sum. A starts being the input number, and this process ends until C becomes a palindromic number – in this case we print in the last line C is a palindromic number.; or if a palindromic number cannot be found in 10 iterations, print Not found in 10 iterations. instead.
Sample Input 1:

97152

Sample Output 1:

97152 + 25179 = 122331
122331 + 133221 = 255552
255552 is a palindromic number.

Sample Input 2:

196

Sample Output 2:

196 + 691 = 887
887 + 788 = 1675
1675 + 5761 = 7436
7436 + 6347 = 13783
13783 + 38731 = 52514
52514 + 41525 = 94039
94039 + 93049 = 187088
187088 + 880781 = 1067869
1067869 + 9687601 = 10755470
10755470 + 07455701 = 18211171
Not found in 10 iterations.

题解：水题
注意三点：第一个是要用大整数类（N超过1000位）
第二个是String类没有反转方法，要用StringBuilder类
第三个是N要先判断一次是不是palindromic number

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String sa = sc.next();
        StringBuilder sba = new StringBuilder(sa).reverse();
        boolean flag = true;
        if(sa.equals(sba.toString())) {
            System.out.println(sa + " is a palindromic number.");
            flag = false;
        }
        int cnt = 0;
        while(flag) {
            cnt++;
            if(cnt > 10) {
                System.out.println("Not found in 10 iterations.");
                break;
            }
            BigInteger a = new BigInteger(sa);
            sba = new StringBuilder(sa).reverse();
            BigInteger b = new BigInteger(sba.toString());
            System.out.print(a + " + " + b + " = ");
            a = a.add(b);
            System.out.println(a);
            sa = a.toString();
            sba = new StringBuilder(sa).reverse();
            if(sa.equals(sba.toString())) {
                System.out.println(a + " is a palindromic number.");
                break;
            }
        }
        sc.close();
    }
}