1024 Palindromic Number （25 分）(大数相加)

最新推荐文章于 2022-02-24 12:35:24 发布

virgilshi

最新推荐文章于 2022-02-24 12:35:24 发布

阅读量945

点赞数 1

分类专栏： PAT 甲级文章标签： PAT 甲级

本文链接：https://blog.csdn.net/whutshiliu/article/details/83089834

版权

PAT 甲级专栏收录该内容

47 篇文章 0 订阅

订阅专栏

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

分析

本题考查的是数的相加和逆序，本属于简单题，但是本质考查了大数相加的知识。第一次提交时未注意到大数相加，测试点6和测试点8（从0开始）未通过，然后在看博客¹才意识到考查大数相加，理由是本题的N的范围是(0,10¹⁰]，k的范围是(0,100]，我们考虑最坏的情况，假设N是一个非常逼近10¹⁰的值并且进行了100步操作依然未得到回文值，则简单推测可知计算过程中遇到的最大值是2¹⁰⁰*10¹⁰，这个值超出了long long int(2⁶³-1，约9.2*10¹⁸)表示范围，因此需要用string存储数的值。

#include <iostream>
#include <algorithm>
using namespace std;
string add(string a){
    string ans=a;
    reverse(a.begin(),a.end());
    int i=a.length()-1,add=0;
    while(i>=0){
        int tmp=a[i]-'0'+ans[i]-'0';
        ans[i]=(add+tmp)%10+'0';
        add=(tmp+add)/10;
        i--;
    }
    if(add) ans.insert(0,"1");
    return ans;
}
int main(){
    string s;
    int k;
    cin>>s>>k;
    string tmp=s;
    reverse(tmp.begin(),tmp.end());
    if(tmp==s) cout<<tmp<<endl<<0;
    else{
        int i=0;
        while(i<k){
            s=add(tmp);
            i++;
            tmp=s;
            reverse(tmp.begin(),tmp.end());
            if(tmp==s) break;
        }
        cout<<s<<endl<<i;
    } 
    return 0;
}