【PAT甲级A1136】 A Delayed Palindrome (20分)（c++）

1136 A Delayed Palindrome (20分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：400 ms
内存限制：64 MB

Consider a positive integer N written in standard notation with k+1 digits a​i​​ as a​k​​ ⋯a​1​​ a​0​​ with 0≤a​i​​ <10 for all i and a​k​​ >0. Then N is palindromic if and only if a​i​​ =a​k−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.

题意：

正着和反着是一样的，则这个数是回文子数，当他不是回文子数时，就与它的翻转数相加形成新的数，直到它成为回文子数为止，最多进行10次操作。

思路：

由于限制了1000位的数，所以要用字符串读入，用reverse对字符串进行反转，比较原来和反转的字符串，相等说明是回文子数，然后进行字符串相加，注意进位。

参考代码：

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

string add(string s1, string s2) {
    int temp = 0;
    string s;
    for (int i = 0; i < s1.length(); i++) {
        int sum = s1[i] - '0' + s2[i] - '0' + temp;
        s += sum % 10 + '0';
        temp = sum / 10;
    }
    return temp != 0 ? s + "1" : s;
}

int main() {
    string str;
    cin >> str;
    bool flag = false;
    for (int i = 0; i < 10; i++) {
        string temp = str;
        reverse(str.begin(), str.end());
        if (str == temp) {
            flag = true;
            break;
        }
        string fstr = add(temp, str);
        reverse(fstr.begin(), fstr.end());
        cout << temp << " + " << str << " = " << fstr << endl;
        str = fstr;
    }
    if (flag)cout << str << " is a palindromic number.";
    else cout << "Not found in 10 iterations.";
    return 0;
}

如有错误，欢迎指正