1079 延迟的回文数 (20 分)

 1//1079 延迟的回文数 (20 分)
 2#include<iostream>
 3#include <algorithm>
 4using namespace std;
 5bool huiwen(string temp1){
 6    int len = temp1.size();
 7    for(int i = 0; i < len/2 + 1; i++){
 8        if(temp1[i] != temp1[len - i - 1]){
 9            return 0;
10        }
11    } 
12    return 1;
13}
14string add(string a,string b){
15    int t=0;
16    for(int i=0;i<b.length();i++){
17        t=t+a[i]-'0'+b[i]-'0';
18        a[i]='0'+t%10;
19        t/=10;
20    }
21    if(t>0) a+="1";
22    reverse(a.begin(),a.end());
23    return a;
24}
25int main(){
26    string a, b, c;
27    cin>>a;
28    int step = 10;
29    for(;step > 0; step--){
30        if(!huiwen(a)){
31            //说明不是回文
32            c = a;
33            reverse(c.begin(), c.end());//逆序 
34            b = c;
35            cout<<a<<" + "<<b<<" = ";
36            a = add(a,b);
37            cout<<a<<endl;
38        }
39        else{
40            cout<<a<<" is a palindromic number.";
41            return 0;
42        }
43    }
44    cout<<"Not found in 10 iterations.";
45    return 0;
46}