1136 A Delayed Palindrome (20 分) 坑

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=1e4+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
string s,t,tmp;
bool judge(){
    int sz=s.size();
    int l=0,r=sz-1;
    while(l<r) {
        if(s[l]!=s[r]) return false;
        l++,r--;
        ///cout<<s[l]<<s[r]<<l<<r<<endl;
    }
    return true;
}
string solve(string x,string y){
    int sz=x.size(),cur=0;
    string ret="";
    char cc;
    for(int i=sz-1;i>=0;i--){
        int xx=x[i]-'0',yy=y[i]-'0';
        int tmp=(xx+cur+yy)%10;
        cur=(xx+cur+yy)/10;
        cc='0'+tmp;
        ret=cc+ret;
    }
    cc='0'+cur;
    if(cur) ret=cc+ret;
    return ret;
}
int cnt=10;

int main(){
    cin>>s;
 	while(cnt--){
    if(judge()) break;
      t=s;
      reverse(t.begin(),t.end());
      tmp=s;
      s=solve(s,t);
      cout<<tmp<<" + "<<t<<" = "<<s<<"\n";
    }
    if(cnt>=0){
        cout<<s<<" is a palindromic number.\n";
    }else{
        cout<<"Not found in 10 iterations.\n";
    }
    return 0;
}