PAT甲级 1136 A Delayed Palindrome (20 分)

Consider a positive integer N written in standard notation with k+1 digits a_i as a_k⋯a₁a₀ 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.

#include <iostream>
#include <algorithm>

using namespace std;

string add(string s1, string s2) {
    string ans;
    int t = 0;
    for (int i = s1.size() - 1; i >= 0; --i) {
        int a = s1[i] - '0' + s2[i] - '0' + t;
        char b = a % 10 + '0';
        t = a / 10;
        ans += b;
    }
    if (t)
        ans += t + '0';
    reverse(ans.begin(), ans.end());
    return ans;
}

bool check(string s) {
    for (int i = 0; i < s.size() / 2; ++i) {
        if (s[i] != s[s.size() - i - 1])
            return false;
    }
    return true;
}

int main() {
    string a, b;
    int k = 0;
    cin >> a;

    while (k != 10) {
        if (check(a)) {
            cout << a << " is a palindromic number.";
            return 0;
        }
        k++;
        b = a;
        reverse(b.begin(), b.end());
        cout << a << " + " << b << " = ";
        a = add(a, b);
        cout << a << endl;
    }
    cout << "Not found in 10 iterations.";
    return 0;
}