PAT甲级1136 A Delayed Palindrome

1136
1024

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.
结尾无空行

这一题可以结合1024，基本是一样的，就是输入输出不同

有两个点是用例2、3、4不过的原因：
1、输入数据有可能本身就是回文的，这个时候就直接输出“255552 is a palindromic number.”这一句就行了，不需要输出加法算式

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
bool ispalindromic(string &s){
    int i = 0,j = s.size() - 1;
    while(i < j){
        if(s[i++] != s[j--]){
            return false;
        }
    }
    return true;
}
string cal(string &a,string &b){
    string res;
    int len = a.size();
    int carry = 0;
    for(int i = len - 1;i >= 0;--i){
        int temp = a[i] - '0' + b[i] - '0' + carry;
        carry = 0;
        if(temp >= 10){
            carry = 1;
            temp %= 10;
        }
        res.insert(0,to_string(temp));
    }
    if(carry == 1){
        res.insert(0,to_string(1));
    }
    return res;
}
int main(){
    string str;
    cin >> str;
    int K = 10;
    int ori = K;
    string res;
    while(!ispalindromic(str)&&K > 0){
        K--;
        string temp = str;
        reverse(temp.begin(),temp.end());
        res = cal(str,temp);
        cout << str << " + " << temp << " = " << res << endl;
        str = res;
    }
    if(K == 10){
        res = str;
    }
    if(ispalindromic(res)){
        cout << res << " is a palindromic number." << endl;
    }
    else{
        cout << "Not found in 10 iterations." << endl;
    }
    return 0;
}