1079 延迟的回文数 (20 分)

思路：
利用string的拼接
代码：

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

int judge(string a){
    for(int i=0;i<a.length();i++){
        if(a[i]!=a[a.length()-i-1])
            return 0;
    }
    return 1;
}

//97152 + 25179 = 122331
//25179
int main(){
    string a,b;
    int n=10,i;
    cin>>a;
    for(i=0;i<n;i++){
        if(judge(a)){
            cout<<a<<" is a palindromic number."<<endl;
            break;
        }
        else{
            int len=a.length();
            b=a;
            reverse(begin(b),begin(b)+len);
            cout<<a<<" + "<<b<<" = ";
            int t,add=0;
            for(int i=len-1;i>=0;i--){
                t=a[i]-'0'+b[i]-'0'+add;
                a[i]=t%10+'0';
                add=t/10;
            }
            if(add)
                a="1"+a;
            cout<<a<<endl;
        }
    }
    if(i>=n)
        cout<<"Not found in 10 iterations.";
    return 0;
}
//187088 +
//880781
//:67869