PAT-A 1136 A Delayed Palindrome（20 分）

#include <iostream>
#include <string>

using namespace std;

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

string change(string n){
    string nr(n),res(n);
    int len=n.size();
    for(int i=0;i<len;i++){
        nr[len-i-1]=n[i];
    }
    int ad=0,sum;
    for(int i=len-1;i>=0;i--){
        sum=n[i]-'0'+nr[i]-'0'+ad;
        res[i]=sum%10+'0';
        ad=sum/10;
    }
    string h;
    h.push_back(ad+'0');
    if(ad!=0){
        res.insert(0,h);
    }
    cout<<n<<" + "<<nr<<" = "<<res<<endl;
    return res;


}
int main()
{
    string num;
    cin>>num;
    for(int i=0;i<10;i++){
        if(judge(num)){
            cout<<num<<" is a palindromic number."<<endl;
            break;
        }else{
            num=change(num);
        }
    }
    if(!judge(num)){
        cout<<"Not found in 10 iterations."<<endl;
    }
    return 0;
}